Related references
Note: Only part of the references are listed.Heuristic algorithms for the capacitated location-routing problem and the multi-depot vehicle routing problem
John Willmer Escobar
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH (2014)
A survey of recent research on location-routing problems
Caroline Prodhon et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2014)
A GRASP + ILP-based metaheuristic for the capacitated location-routing problem
Claudio Contardo et al.
JOURNAL OF HEURISTICS (2014)
An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem
Claudio Contardo et al.
INFORMS JOURNAL ON COMPUTING (2014)
A computational comparison of flow formulations for the capacitated location-routing problem
Claudio Contardo et al.
DISCRETE OPTIMIZATION (2013)
A multiple ant colony optimization algorithm for the capacitated location routing problem
Ching-Jung Ting et al.
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS (2013)
An Adaptive Variable Neighborhood Search Algorithm for a Vehicle Routing Problem Arising in Small Package Shipping
Andreas Stenger et al.
TRANSPORTATION SCIENCE (2013)
An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics
Vera C. Hemmelmayr et al.
COMPUTERS & OPERATIONS RESEARCH (2012)
Column generation based heuristics for a generalized location routing problem with profits arising in space exploration
Jaemyung Anna et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2012)
A Branch-and-Cut method for the Capacitated Location-Routing Problem
Jose-Manuel Belenguer et al.
COMPUTERS & OPERATIONS RESEARCH (2011)
The orienteering problem: A survey
Pieter Vansteenwegen et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2011)
An Exact Method for the Capacitated Location-Routing Problem
Roberto Baldacci et al.
OPERATIONS RESEARCH (2011)
LEMON - an Open Source C++ Graph Template Library
Balazs Dezso et al.
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE (2011)
A GRASPxELS approach for the capacitated location-routing problem
Christophe Duhamel et al.
COMPUTERS & OPERATIONS RESEARCH (2010)
A Branch-and-Price Algorithm for Combined Location and Routing Problems Under Capacity Restrictions
Z. Akca et al.
OPERATIONS RESEARCH AND CYBER-INFRASTRUCTURE (2009)
ODD MINIMUM CUT SETS AND b-MATCHINGS REVISITED
Adam N. Letchford et al.
SIAM JOURNAL ON DISCRETE MATHEMATICS (2008)
Solving the capacitated location-routing problem by a cooperative lagrangean relaxation-granular tabu search heuristic
Christian Prins et al.
TRANSPORTATION SCIENCE (2007)
Using clustering analysis location-routing in a capacitated problem
Sergio Barreto et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2007)
Location-routing: Issues, models and methods
Gabor Nagy et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2007)
A metaheuristic to solve a location-routing problem with non-linear costs
J Melechovsky et al.
JOURNAL OF HEURISTICS (2005)
Traveling salesman problems with profits
D Feillet et al.
TRANSPORTATION SCIENCE (2005)
A compact model and tight bounds for a combined location-routing problem
M Albareda-Sambola et al.
COMPUTERS & OPERATIONS RESEARCH (2005)
A new branch-and-cut algorithm for the capacitated vehicle routing problem
J Lysgaard et al.
MATHEMATICAL PROGRAMMING (2004)
The granular tabu search and its application to the vehicle-routing problem
P Toth et al.
INFORMS JOURNAL ON COMPUTING (2003)
Share Paper
