Simultaneously exploiting two formulations : an exact benders decomposition approach
Year of publication: |
2020
|
---|---|
Authors: | Lusby, Richard Martin ; Gamst, Mette ; Ropke, Stefan ; Spoorendonk, Simon |
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. 123.2020, p. 1-17
|
Subject: | Benders decomposition | Cutting stock problem | Mixed integer programming | Split delivery vehicle routing | Dekompositionsverfahren | Decomposition method | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming | Tourenplanung | Vehicle routing problem | Packproblem | Packing problem |
-
Solving robust bin-packing problems with a branch-and-price approach
Schepler, Xavier, (2022)
-
Mathematical models and decomposition algorithms for cutting and packing problems
Delorme, Maxence, (2018)
-
A fill-and-reduce greedy algorithm for the container pre-marshalling problem
Araya, Ignacio, (2023)
- More ...
-
Exact and heuristic methods for the split delivery vehicle routing problem
Gamst, Mette, (2024)
-
A Branch-and-Cut Algorithm for the Symmetric Two-Echelon Capacitated Vehicle Routing Problem
Jepsen, Mads, (2013)
-
A branch-and-cut algorithm for the symmetric two-echelon capacitated vehicle routing problem
Jepsen, Mads, (2013)
- More ...