An exact algorithm based on cut-and-column generation for the capacitated location-routing problem
Year of publication: |
2014
|
---|---|
Authors: | Contardo, Claudio ; Cordeau, Jean-François ; Gendron, Bernard |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 26.2014, 1, p. 88-102
|
Subject: | location routing | vehicle routing | branch-and-cut-and-price | column generation | Tourenplanung | Vehicle routing problem | Algorithmus | Algorithm | Betriebliche Standortwahl | Firm location choice | Heuristik | Heuristics |
-
Planning for meals-on-wheels : algorithms and application
Yildiz, H., (2013)
-
Heuristic algorithms for the single allocation p-hub center problem with routing considerations
Kartal, Zühal, (2019)
-
A comparison of column-generation approaches to the synchronized pickup and delivery problem
Gschwind, Timo, (2015)
- More ...
-
Benders, metric and cutset inequalities for multicommodity capacitated network design
Costa, Alysson, (2009)
-
Benders, metric and cutset inequalities for multicommodity capacitated network design
Costa, Alysson M., (2009)
-
Solving a dynamic facility location problem with partial closing and reopening
Jena, Sanjay Dominik, (2016)
- More ...