Gábor Nagy
Affiliations:- University of Kent, Centre for Logistics and Heuristic Optimisation, CLHO, Kent Business School, Canterbury, UK
According to our database1,
Gábor Nagy
authored at least 20 papers
between 1999 and 2019.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2019
A matheuristic approach for the split delivery vehicle routing problem: an efficient set covering-based model with guided route generation schemes.
Int. J. Math. Oper. Res., 2019
2018
The heterogeneous fleet vehicle routing problem with light loads and overtime: Formulation and population variable neighbourhood search with adaptive memory.
Expert Syst. Appl., 2018
Eur. J. Oper. Res., 2018
2017
Eur. J. Oper. Res., 2017
The Multiple Trip Vehicle Routing Problem with Backhauls: Formulation and a Two-Level Variable Neighbourhood Search.
Comput. Oper. Res., 2017
2016
Electron. Notes Discret. Math., 2016
An adaptive perturbation-based heuristic: An application to the continuous p-centre problem.
Comput. Oper. Res., 2016
2015
Transp. Sci., 2015
Solving a novel multi-objective uncapacitated hub location problemby five meta-heuristics.
J. Intell. Fuzzy Syst., 2015
The continuous p-centre problem: An investigation into variable neighbourhood search with memory.
Eur. J. Oper. Res., 2015
2013
J. Sched., 2013
Int. J. Energy Optim. Eng., 2013
2011
Comput. Oper. Res., 2011
2009
Comput. Oper. Res., 2009
Ann. Oper. Res., 2009
2008
A heuristic method for the vehicle routing problem with mixed deliveries and pickups.
J. Sched., 2008
A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries.
J. Comb. Optim., 2008
2007
2005
Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries.
Eur. J. Oper. Res., 2005
1999
A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling.
J. Oper. Res. Soc., 1999