A branch-and-cut embedded matheuristic for the inventory routing problem
Year of publication: |
2023
|
---|---|
Authors: | Skålnes, Jørgen ; Vadseth, Simen Tung ; Andersson, Henrik ; Stålhane, Magnus |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 159.2023, p. 1-14
|
Subject: | Branch-and-cut | DIMACS Implementation Challenge | Inventory routing problem | Matheuristic | Tourenplanung | Vehicle routing problem | Lagermanagement | Warehouse management | Bestandsmanagement | Inventory management | Lieferkette | Supply chain |
-
Inventory routing with heterogeneous vehicles and backhauling
Avishan, Farzad, (2024)
-
A matheuristic for solving inventory sharing problems
Achamrah, Fatima Ezzahra, (2022)
-
Managing stochastic demand in an inventory routing problem with transportation procurement
Bertazzi, Luca, (2015)
- More ...
-
A multi-start route improving matheuristic for the production routeing problem
Vadseth, Simen Tung, (2023)
-
An improved formulation for the inventory routing problem with time-varying demands
Skålnes, Jørgen, (2022)
-
A Branch-and-Cut Embedded Matheuristic for the Inventory Routing Problem
Skålnes, Jørgen, (2023)
- More ...