Seyyed Ali MirHassani

Affiliations:
  • Amirkabir University of Technology, Tehran, Iran


According to our database1, Seyyed Ali MirHassani authored at least 28 papers between 2000 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Prioritized Deployment of Dynamic Service Function Chains.
IEEE/ACM Trans. Netw., 2021

Solving two-dimensional cutting stock problem via a DNA computing algorithm.
Nat. Comput., 2021

EIA-CNDP: An exact iterative algorithm for critical node detection problem.
Comput. Oper. Res., 2021

2020
Two-stage stochastic programming model to locate capacitated EV-charging stations in urban areas under demand uncertainty.
EURO J. Transp. Logist., 2020

Logic-based benders decomposition algorithm for contamination detection problem in water networks.
Comput. Oper. Res., 2020

2019
A Fast Near-Optimal Approach for Energy-Aware SFC Deployment.
IEEE Trans. Netw. Serv. Manag., 2019

Accelerating benders decomposition: multiple cuts via multiple solutions.
J. Comb. Optim., 2019

Stochastic virtual network embedding via accelerated Benders decomposition.
Future Gener. Comput. Syst., 2019

Benders decomposition with integer sub-problem applied to pipeline scheduling problem under flow rate uncertainty.
Comput. Chem. Eng., 2019

Enabling Emergency Flow Prioritization in SDN Networks.
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 flow-refueling capacitated stations.
Int. Trans. Oper. Res., 2017

2016
Efficient constraint reduction in multistage stochastic programming problems with endogenous uncertainty.
Optim. Methods Softw., 2016

2015
Lagrangean relaxation-based algorithm for bi-level problems.
Optim. Methods Softw., 2015

Quantum binary particle swarm optimization-based algorithm for solving a class of bi-level competitive facility location problems.
Optim. Methods Softw., 2015

2014
A hybrid Firefly-Genetic Algorithm for the capacitated facility location problem.
Inf. Sci., 2014

2013
A Flexible Reformulation of the Refueling Station Location Problem.
Transp. Sci., 2013

A heuristic batch sequencing for multiproduct pipelines.
Comput. Chem. Eng., 2013

Solution approaches to the course timetabling problem.
Artif. Intell. Rev., 2013

2011
A particle swarm optimization algorithm for open vehicle routing problem.
Expert Syst. Appl., 2011

Scheduling multi-product tree-structure pipelines.
Comput. Chem. Eng., 2011

2008
The multi-product pipeline scheduling system.
Comput. Math. Appl., 2008

An operational planning model for petroleum products logistics under uncertainty.
Appl. Math. Comput., 2008

2006
A computational approach to enhancing course timetabling with integer programming.
Appl. Math. Comput., 2006

Improving paper spread in examination timetables using integer programming.
Appl. Math. Comput., 2006

2005
An efficient approach for computing non-Archimedean 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
Computational solution of capacity planning models under uncertainty.
Parallel Comput., 2000


  Loading...