default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSeyyed Ali MirHassani
Person information
- affiliation: Amirkabir University of Technology, Tehran, Iran
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j36]Mohammad Nasir Yarahmadi, Seyyed Ali MirHassani, Farnaz Hooshmand
:
Handling the significance of regression coefficients via optimization. Expert Syst. Appl. 238(Part C): 121910 (2024)- [j35]Mercedeh Dodge, Seyyed Ali MirHassani, Farnaz Hooshmand:
A modelling and solution approach for wind-affected drone-truck routing problem under uncertainty. Expert Syst. Appl. 257: 124996 (2024) - [j34]Farnaz Hooshmand, F. Vahdat, S. A. MirHassani:
A sensor location model and an efficient GA for the traffic volume estimation. Soft Comput. 28(4): 2987-3013 (2024) - 2023
- [j33]A. Farshidvard, Farnaz Hooshmand, S. A. MirHassani:
A novel two-phase clustering-based under-sampling method for imbalanced classification problems. Expert Syst. Appl. 213(Part): 119003 (2023) - [j32]Farnaz Hooshmand, Z. Anoushirvani, S. A. MirHassani:
Model and efficient algorithm for the portfolio selection problem with real-world constraints under value-at-risk measure. Int. Trans. Oper. Res. 30(5): 2665-2690 (2023) - [j31]Mohammad Nasir Yarahmadi, S. A. MirHassani, Farnaz Hooshmand:
A heuristic method to find a quick feasible solution based on the ratio programming. Oper. Res. 23(3): 41 (2023) - 2022
- [j30]S. M. Mirhadi, S. A. MirHassani:
A solution approach for cardinality minimization problem based on fractional programming. J. Comb. Optim. 44(1): 583-602 (2022) - [j29]Neda Beheshti Asl, S. A. MirHassani, Susana Relvas, Farnaz Hooshmand:
A novel two-phase decomposition-based algorithm to solve MINLP pipeline scheduling problem. Oper. Res. 22(5): 4829-4863 (2022) - [j28]Ahmadreza Ghaffari, Mahmoud Mesbah, Ali Khodaii, S. Ali MirHassani:
Risk-Based Formulation of the Transit Priority Network Design. IEEE Trans. Intell. Transp. Syst. 23(7): 8895-8905 (2022) - 2021
- [j27]Javad Rezaei, Fatemeh Zare-Mirakabad, Seyyed Ali MirHassani, Sayed-Amir Marashi:
EIA-CNDP: An exact iterative algorithm for critical node detection problem. Comput. Oper. Res. 127: 105138 (2021) - [j26]Mercedeh Dodge, S. A. MirHassani, Farnaz Hooshmand:
Solving two-dimensional cutting stock problem via a DNA computing algorithm. Nat. Comput. 20(1): 145-159 (2021) - [j25]Behrooz Farkiani, Bahador Bakhshi, S. Ali MirHassani, Tim Wauters, Bruno Volckaert, Filip De Turck:
Prioritized Deployment of Dynamic Service Function Chains. IEEE/ACM Trans. Netw. 29(3): 979-993 (2021) - 2020
- [j24]Farnaz Hooshmand, Fatemeh Amerehi, S. A. MirHassani:
Logic-based benders decomposition algorithm for contamination detection problem in water networks. Comput. Oper. Res. 115: 104840 (2020) - [j23]S. A. MirHassani, A. Khaleghi, Farnaz Hooshmand:
Two-stage stochastic programming model to locate capacitated EV-charging stations in urban areas under demand uncertainty. EURO J. Transp. Logist. 9(4): 100025 (2020) - 2019
- [j22]Neda Beheshti Asl, S. A. MirHassani:
Benders decomposition with integer sub-problem applied to pipeline scheduling problem under flow rate uncertainty. Comput. Chem. Eng. 123: 222-235 (2019) - [j21]Behrooz Farkiani, Bahador Bakhshi, S. Ali MirHassani:
Stochastic virtual network embedding via accelerated Benders decomposition. Future Gener. Comput. Syst. 94: 199-213 (2019) - [j20]Neda Beheshti Asl, S. A. MirHassani:
Accelerating benders decomposition: multiple cuts via multiple solutions. J. Comb. Optim. 37(3): 806-826 (2019) - [j19]Behrooz Farkiani, Bahador Bakhshi, S. A. MirHassani:
A Fast Near-Optimal Approach for Energy-Aware SFC Deployment. IEEE Trans. Netw. Serv. Manag. 16(4): 1360-1373 (2019) - 2018
- [j18]Farnaz Hooshmand, S. A. MirHassani:
Reduction of nonanticipativity constraints in multistage stochastic programming problems with endogenous and exogenous uncertainty. Math. Methods Oper. Res. 87(1): 1-18 (2018) - 2017
- [j17]Meysam Hosseini, S. A. MirHassani:
A heuristic algorithm for optimal location of flow-refueling capacitated stations. Int. Trans. Oper. Res. 24(6): 1377-1403 (2017) - 2016
- [j16]Farnaz Hooshmand, S. A. MirHassani:
Efficient constraint reduction in multistage stochastic programming problems with endogenous uncertainty. Optim. Methods Softw. 31(2): 359-376 (2016) - 2015
- [j15]Arsalan Rahmani, S. A. MirHassani:
Lagrangean relaxation-based algorithm for bi-level problems. Optim. Methods Softw. 30(1): 1-14 (2015) - [j14]S. A. MirHassani, Samaneh Raeisi, Arsalan Rahmani:
Quantum binary particle swarm optimization-based algorithm for solving a class of bi-level competitive facility location problems. Optim. Methods Softw. 30(4): 756-768 (2015) - 2014
- [j13]Arsalan Rahmani, S. A. MirHassani:
A hybrid Firefly-Genetic Algorithm for the capacitated facility location problem. Inf. Sci. 283: 70-78 (2014) - 2013
- [j12]Seyyed Ali MirHassani, F. Habibi:
Solution approaches to the course timetabling problem. Artif. Intell. Rev. 39(2): 133-149 (2013) - [j11]S. A. MirHassani, Neda Beheshti Asl:
A heuristic batch sequencing for multiproduct pipelines. Comput. Chem. Eng. 56: 58-67 (2013) - [j10]S. A. MirHassani, R. Ebrazi:
A Flexible Reformulation of the Refueling Station Location Problem. Transp. Sci. 47(4): 617-628 (2013) - 2011
- [j9]S. A. MirHassani, H. Fani Jahromi:
Scheduling multi-product tree-structure pipelines. Comput. Chem. Eng. 35(1): 165-176 (2011) - [j8]S. A. MirHassani, N. Abolghasemi:
A particle swarm optimization algorithm for open vehicle routing problem. Expert Syst. Appl. 38(9): 11547-11551 (2011) - 2008
- [j7]S. A. MirHassani:
An operational planning model for petroleum products logistics under uncertainty. Appl. Math. Comput. 196(2): 744-751 (2008) - [j6]S. A. MirHassani, M. Ghorbanalizadeh:
The multi-product pipeline scheduling system. Comput. Math. Appl. 56(4): 891-897 (2008) - 2006
- [j5]S. A. MirHassani:
A computational approach to enhancing course timetabling with integer programming. Appl. Math. Comput. 175(1): 814-822 (2006) - [j4]S. A. MirHassani:
Improving paper spread in examination timetables using integer programming. Appl. Math. Comput. 179(2): 702-706 (2006) - 2005
- [j3]S. A. MirHassani, M. R. Alirezaee:
An efficient approach for computing non-Archimedean epsilon in DEA based on integrated models. Appl. Math. Comput. 166(2): 449-456 (2005) - 2001
- [j2]Cormac Lucas, Seyyed Ali MirHassani, Gautam Mitra, Chandra A. Poojari:
An application of Lagrangian relaxation to a capacity planning problem under uncertainty. J. Oper. Res. Soc. 52(11): 1256-1266 (2001) - 2000
- [j1]S. A. MirHassani, Cormac Lucas, Gautam Mitra, Enza Messina, Chandra A. Poojari:
Computational solution of capacity planning models under uncertainty. Parallel Comput. 26(5): 511-538 (2000)
Conference and Workshop Papers
- 2021
- [c2]Farnaz Hooshmand, S. A. MirHassani:
Efficient DC Algorithm for the Index-Tracking Problem. ICO 2021: 566-576 - 2019
- [c1]Jerico Moeyersons, Behrooz Farkiani, Bahador Bakhshi, Seyyed Ali MirHassani, Tim Wauters, Bruno Volckaert, Filip De Turck:
Enabling Emergency Flow Prioritization in SDN Networks. CNSM 2019: 1-8
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 02:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
