default search action
Nader Ghaffari-Nasab
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j12]Abdullah Zareh Andaryan, Kasra Mousighichi
, Nader Ghaffari-Nasab
A heuristic approach to the stochastic capacitated single allocation hub location problem with Bernoulli demands. Eur. J. Oper. Res. 312(3): 954-968 (2024) - 2022
- [j11]Sina Khodaee
Competitive multiple allocation hub location problem considering primary and backup routes. Comput. Appl. Math. 41(4) (2022) - [j10]Nader Ghaffari-Nasab
Stochastic hub location problems with Bernoulli demands. Comput. Oper. Res. 145: 105851 (2022) - [j9]Nader Ghaffari-Nasab
Exact algorithms for the robust uncapacitated multiple allocation p-hub median problem. Optim. Lett. 16(6): 1745-1772 (2022) - 2021
- [j8]Nader Ghaffari-Nasab
Modeling and solving the uncapacitated r-allocation p-hub median problem under congestion. Comput. Appl. Math. 40(7) (2021)
2010 – 2019
- 2018
- [j7]Nader Ghaffari-Nasab
Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems. Comput. Oper. Res. 90: 173-192 (2018) - [j6]Nader Ghaffari-Nasab
An efficient matheuristic for the robust multiple allocation p-hub median problem under polyhedral demand uncertainty. Comput. Oper. Res. 97: 31-47 (2018) - [j5]Nader Ghaffari-Nasab
A continuous approximation approach to the planar hub location-routing problem: Modeling and solution algorithms. Comput. Oper. Res. 100: 140-154 (2018) - [j4]Nader Ghaffari-Nasab
An implicit enumeration algorithm for the hub interdiction median problem with fortification. Eur. J. Oper. Res. 267(1): 23-39 (2018) - [j3]Nader Ghaffari-Nasab
Hub interdiction problem variants: Models and metaheuristic solution algorithms. Eur. J. Oper. Res. 267(2): 496-512 (2018) - 2013
- [j2]Ali Saboury, Nader Ghaffari-Nasab
Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks. Comput. Oper. Res. 40(10): 2493-2507 (2013) - 2012
- [j1]Mohamad Saeed Jabalameli, Farnaz Barzinpour, Ali Saboury, Nader Ghaffari-Nasab:
A simulated annealing-based heuristic for the single allocation maximal covering hub location problem. Int. J. Metaheuristics 2(1): 15-37 (2012)
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-04-24 22:51 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: