Seyyed Ali MirHassani
Affiliations: Amirkabir University of Technology, Tehran, Iran
According to our database^{1},
Seyyed Ali MirHassani
authored at least 28 papers
between 2000 and 2021.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on orcid.org
On csauthors.net:
Bibliography
2021
IEEE/ACM Trans. Netw., 2021
Nat. Comput., 2021
Comput. Oper. Res., 2021
2020
Twostage stochastic programming model to locate capacitated EVcharging stations in urban areas under demand uncertainty.
EURO J. Transp. Logist., 2020
Logicbased benders decomposition algorithm for contamination detection problem in water networks.
Comput. Oper. Res., 2020
2019
IEEE Trans. Netw. Serv. Manag., 2019
J. Comb. Optim., 2019
Future Gener. Comput. Syst., 2019
Benders decomposition with integer subproblem applied to pipeline scheduling problem under flow rate uncertainty.
Comput. Chem. Eng., 2019
Proceedings of the 15th International Conference on Network and Service Management, 2019
2018
Reduction of nonanticipativity constraints in multistage stochastic programming problems with endogenous and exogenous uncertainty.
Math. Methods Oper. Res., 2018
2017
A heuristic algorithm for optimal location of flowrefueling capacitated stations.
Int. Trans. Oper. Res., 2017
2016
Efficient constraint reduction in multistage stochastic programming problems with endogenous uncertainty.
Optim. Methods Softw., 2016
2015
Optim. Methods Softw., 2015
Quantum binary particle swarm optimizationbased algorithm for solving a class of bilevel competitive facility location problems.
Optim. Methods Softw., 2015
2014
Inf. Sci., 2014
2013
Transp. Sci., 2013
Comput. Chem. Eng., 2013
Artif. Intell. Rev., 2013
2011
Expert Syst. Appl., 2011
Comput. Chem. Eng., 2011
2008
Comput. Math. Appl., 2008
Appl. Math. Comput., 2008
2006
A computational approach to enhancing course timetabling with integer programming.
Appl. Math. Comput., 2006
Appl. Math. Comput., 2006
2005
An efficient approach for computing nonArchimedean epsilon in DEA based on integrated models.
Appl. Math. Comput., 2005
2001
An application of Lagrangian relaxation to a capacity planning problem under uncertainty.
J. Oper. Res. Soc., 2001
2000
Parallel Comput., 2000