Formulations for an inventory routing problem
Year of publication: |
2014
|
---|---|
Authors: | Archetti, Claudia ; Bianchessi, Nicola ; Irnich, Stefan ; Speranza, Maria Grazia |
Published in: |
International transactions in operational research : ITOR ; a journal of the International Federation of Operational Research Societies (IFORS). - Oxford : Wiley, ISSN 0969-6016, ZDB-ID 1213721-2. - Vol. 21.2014, 3, p. 353-374
|
Subject: | routing problems | integer programming | branch-and-cut algorithm | supply chain management | Tourenplanung | Vehicle routing problem | Lieferkette | Supply chain | Ganzzahlige Optimierung | Integer programming | Algorithmus | Algorithm | Bestandsmanagement | Inventory management |
-
A shortest path-based algorithm for the inventory routing problem of waste vegetable oil collection
Montagné, Romain, (2019)
-
A variable MIP neighborhood descent for the multi-attribute inventory routing problem
Coelho, Leandro C., (2020)
-
The shared customer collaboration vehicle routing problem
Fernández, Elena, (2018)
- More ...
-
Branch-and-cut algorithms for the split delivery vehicle routing problem
Archetti, Claudia, (2014)
-
Archetti, Claudia, (2014)
-
Branch-and-price-and-cut for the active-passive vehicle-routing problem
Tilk, Christian, (2018)
- More ...