Resource-window reduction by reduced costs in path-based formulations for routing and scheduling problems
Year of publication: |
2024
|
---|---|
Authors: | Bianchessi, Nicola ; Gschwind, Timo ; Irnich, Stefan |
Published in: |
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 36.2024, 1, p. 224-244
|
Subject: | column generation | integer programming | resource windows reduction | variable fixing | vehicle routing | Tourenplanung | Vehicle routing problem | Scheduling-Verfahren | Scheduling problem | Ganzzahlige Optimierung | Integer programming | Theorie | Theory |
-
Dispatch optimization in bulk tanker transport operations
Gifford, Ted, (2018)
-
Variable fixing for two-arc sequences in branch-price-and-cut algorithms on path-based models
Desaulniers, Guy, (2020)
-
Sun, Peter, (2014)
- More ...
-
Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem
Gschwind, Timo, (2019)
-
Formulations for an inventory routing problem
Archetti, Claudia, (2014)
-
Branch-and-price-and-cut for the active-passive vehicle-routing problem
Tilk, Christian, (2018)
- More ...