The meet-in-the-middle principle for cutting and packing problems
Year of publication: |
2018
|
---|---|
Authors: | Côté, Jean-François ; Iori, Manuel |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 30.2018, 4, p. 646-661
|
Subject: | cutting and packing | normal patterns | meet in the middle | cutting stock | orthogonal packing | Ganzzahlige Optimierung | Integer programming | USA | United States | Packproblem | Packing problem |
-
Cutting stock problems with nondeterministic item lengths : a new approach to server consolidation
Martinovic, John, (2019)
-
The one-dimensional cutting stock problem with sequence-dependent cut losses
Garraffa, Michele, (2016)
-
Bin packing problem with time lags
Rivera Letelier, Orlando, (2022)
- More ...
-
Combinatorial Benders' cuts for the strip packing problem
Côté, Jean-François, (2014)
-
Dynamic optimization algorithms for same-day delivery problems
Côté, Jean-François, (2021)
-
Combinatorial benders decomposition for the two-dimensional bin packing problem
Côté, Jean-François, (2021)
- More ...