Combinatorial Benders' cuts for the strip packing problem
Year of publication: |
2014
|
---|---|
Authors: | Côté, Jean-François ; Dell'Amico, Mauro ; Iori, Manuel |
Published in: |
Operations research. - Catonsville, MD : INFORMS, ISSN 0030-364X, ZDB-ID 123389-0. - Vol. 62.2014, 3, p. 643-661
|
Subject: | strip packing problem | exact algorithm | Benders' decomposition | combinatorial Benders' cut | Packproblem | Packing problem | Algorithmus | Algorithm | Dekompositionsverfahren | Decomposition method | Operations Research | Operations research | Scheduling-Verfahren | Scheduling problem |
-
Mathematical models and decomposition algorithms for cutting and packing problems
Delorme, Maxence, (2018)
-
Wagenaar, Joris, (2023)
-
Upper bounds for heuristic approaches to the strip packing problem
Buchwald, Torsten, (2016)
- More ...
-
The meet-in-the-middle principle for cutting and packing problems
Côté, Jean-François, (2018)
-
Dynamic optimization algorithms for same-day delivery problems
Côté, Jean-François, (2021)
-
A branch-and-regret algorithm for the same-day delivery problem
Côté, Jean-François, (2023)
- More ...