Branch-and-price-and-cut for the active-passive vehicle-routing problem
| Year of publication: |
March-April 2018
|
|---|---|
| Authors: | Tilk, Christian ; Bianchessi, Nicola ; Drexl, Michael ; Irnich, Stefan ; Meisel, Frank |
| 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. 52.2018, 2, p. 300-319
|
| Subject: | vehicle-routing | synchronization | branch-and-price | linear vertex costs | Theorie | Theory | Tourenplanung | Vehicle routing problem | Mathematische Optimierung | Mathematical programming |
-
Classification, models and exact algorithms for multi-compartment delivery problems
Coelho, Leandro C., (2015)
-
Exact methods for the traveling salesman problem with drone
Roberti, Roberto, (2021)
-
The min-max close-enough arc routing problem
Bianchessi, Nicola, (2022)
- More ...
-
The split delivery vehicle routing problem with time windows and customer inconvenience constraints
Bianchessi, Nicola, (2019)
-
Tilk, Christian, (2019)
-
Seaside operations planning in container terminals
Meisel, Frank, (2009)
- More ...