Combinatorial benders decomposition for the two-dimensional bin packing problem
Year of publication: |
2021
|
---|---|
Authors: | Côté, Jean-François ; Haouari, Mohamed ; Iori, Manuel |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 33.2021, 3, p. 963-978
|
Subject: | two-dimensional bin packing problem | exact algorithm | Benders decomposition | combinatorial Benders cut | Dekompositionsverfahren | Decomposition method | Packproblem | Packing problem | Algorithmus | Algorithm | Theorie | Theory | Heuristik | Heuristics | Ganzzahlige Optimierung | Integer programming |
-
A branch-and-price algorithm for the two-dimensional vector packing problem
Wei, Lijun, (2020)
-
Mathematical models and decomposition algorithms for cutting and packing problems
Delorme, Maxence, (2018)
-
Ring hierarchical hub network design problem : exact and heuristic solution methods
Eydi, Alireza, (2022)
- More ...
-
Combinatorial Benders' cuts for the strip packing problem
Côté, Jean-François, (2014)
-
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)
- More ...