A branch-price-and-cut algorithm for the inventory-routing problem
Year of publication: |
August 2016
|
---|---|
Authors: | Desaulniers, Guy ; Rakke, Jørgen G. ; Coelho, Leandro C. |
Published in: |
Transportation science : a journal of the Institute for Operations Research and the Management Sciences. - Catonsville, MD : Transportation Science & Logistics Society of the Institute for Operations Research and the Management Sciences, ISSN 0041-1655, ZDB-ID 160958-0. - Vol. 50.2016, 3, p. 1060-1076
|
Subject: | inventory routing | branch price and cut | capacity inequalities | labeling algorithm | exact algorithm | Algorithmus | Algorithm | Tourenplanung | Vehicle routing problem | Theorie | Theory |
-
Variable fixing for two-arc sequences in branch-price-and-cut algorithms on path-based models
Desaulniers, Guy, (2020)
-
Exact algorithms for electric vehicle-routing problems with time windows
Desaulniers, Guy, (2016)
-
New exact algorithm for the vehicle routing problem with stochastic demands
Florio, Alexandre M., (2020)
- More ...
-
Arnesen, Mari Jevne, (2017)
-
Planning interrelated voyages with separation requirements in roll-on roll-off shipping
Hansen, Jone R., (2019)
-
Flexibility and consistency in inventory-routing
Coelho, Leandro C., (2013)
- More ...