A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries
Year of publication: |
2020
|
---|---|
Authors: | Archetti, Claudia ; Speranza, Maria Grazia ; Boccia, Maurizio ; Sforza, Antonio ; Sterle, Claudio |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 282.2020, 3 (1.5.), p. 886-895
|
Subject: | Branch-and-cut | Inventory management | Lot-sizing reformulation | Pickups and deliveries | Routing | Tourenplanung | Vehicle routing problem | Algorithmus | Algorithm | Bestandsmanagement | Heuristik | Heuristics | Lagermanagement | Warehouse management | Logistikunternehmen | Logistics provider | Ganzzahlige Optimierung | Integer programming |
-
A shortest path-based algorithm for the inventory routing problem of waste vegetable oil collection
Montagné, Romain, (2019)
-
Anholt, Roel G. van, (2016)
-
Neves-Moreira, Fábio, (2022)
- More ...
-
Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
Russo, Mauro, (2019)
-
A fast heuristic for a three-dimensional non-convex domain loading problem
Boccia, Maurizio, (2011)
-
A fast heuristic for a three-dimensional non-convex domain loading problem
Boccia, Maurizio, (2011)
- More ...