Two-phase branch-and-cut for the mixed capacitated general routing problem
Year of publication: |
2015
|
---|---|
Authors: | Irnich, Stefan ; Laganà, Demetrio ; Schlebusch, Claudia ; Vocaturo, Francesca |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 243.2015, 1 (16.5.), p. 17-29
|
Subject: | General routing problem | Mixed graph | Integer programming | Branch-and-cut algorithm | Tourenplanung | Vehicle routing problem | Ganzzahlige Optimierung | Algorithmus | Algorithm | Graphentheorie | Graph theory | Mathematische Optimierung | Mathematical programming |
-
Bektaş, Tolga, (2019)
-
Branch-price-and-cut for the Mixed Capacitated General Routing Problem with time windows
Ciancio, Claudio, (2018)
-
Mathematical models and routing algorithms for economical cutting tool paths
Makarovskikh, T. A., (2018)
- More ...
-
Two-phase branch-and-cut for the mixed capacitated general routing problem
Irnich, Stefan, (2015)
-
Modeling and solving the mixed capacitated general routing problem
Bosco, Adamo, (2013)
-
A decomposition-based heuristic for the multiple-product inventory-routing problem
Cordeau, Jean-François, (2015)
- More ...