Nader Ghaffari-Nasab

According to our database, Nader Ghaffari-Nasab authored at least 12 papers between 2012 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

A heuristic approach to the stochastic capacitated single allocation hub location problem with Bernoulli demands.

Abdullah Zareh Andaryan, Kasra Mousighichi, Nader Ghaffari-Nasab

Eur. J. Oper. Res., February, 2024

2022

Competitive multiple allocation hub location problem considering primary and backup routes.

Sina Khodaee, Emad Roghanian, Nader Ghaffari-Nasab

Comput. Appl. Math., June, 2022

Exact algorithms for the robust uncapacitated multiple allocation p-hub median problem.

Nader Ghaffari-Nasab

Optim. Lett., 2022

Stochastic hub location problems with Bernoulli demands.

Nader Ghaffari-Nasab

Comput. Oper. Res., 2022

2021

Modeling and solving the uncapacitated r-allocation p-hub median problem under congestion.

Nader Ghaffari-Nasab, Alireza Motallebzadeh

Comput. Appl. Math., 2021

2018

Hub interdiction problem variants: Models and metaheuristic solution algorithms.

Nader Ghaffari-Nasab, Alireza Motallebzadeh

Eur. J. Oper. Res., 2018

An implicit enumeration algorithm for the hub interdiction median problem with fortification.

Nader Ghaffari-Nasab, Reza Atayi

Eur. J. Oper. Res., 2018

A continuous approximation approach to the planar hub location-routing problem: Modeling and solution algorithms.

Nader Ghaffari-Nasab, Tom Van Woensel, Stefan Minner

Comput. Oper. Res., 2018

Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems.

Nader Ghaffari-Nasab, Alireza Motallebzadeh, Younis Jabarzadeh, Bahar Yetis Kara

Comput. Oper. Res., 2018

An efficient matheuristic for the robust multiple allocation <i>p</i>-hub median problem under polyhedral demand uncertainty.

Nader Ghaffari-Nasab

Comput. Oper. Res., 2018

2013

Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks.

Ali Saboury, Nader Ghaffari-Nasab, Farnaz Barzinpour, Mohamad Saeed Jabalameli

Comput. Oper. Res., 2013

2012

A simulated annealing-based heuristic for the single allocation maximal covering hub location problem.

Mohamad Saeed Jabalameli, Farnaz Barzinpour, Ali Saboury, Nader Ghaffari-Nasab

Int. J. Metaheuristics, 2012