A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint
| Year of publication: |
2012
|
|---|---|
| Authors: | Bortfeldt, Andreas ; Jungmann, Sabine |
| Published in: |
Annals of operations research. - Dordrecht, The Netherlands : Springer Nature B.V., ISSN 0254-5330, ZDB-ID 252629-3. - Vol. 196.2012, p. 53-71
|
| Subject: | Algorithmus | Algorithm | Packproblem | Packing problem | Theorie | Theory | Heuristik | Heuristics | Ganzzahlige Optimierung | Integer programming | Operations Research | Operations research |
-
Models and algorithms for the bin-packing problem with minimum color fragmentation
Mehrani, Saharnaz, (2022)
-
Compact integer linear programming formulations for the temporal bin packing problem with fire-ups
Martinovic, John, (2021)
-
A clique covering MIP model for the irregular strip packing problem
Rodrigues, Marcos Okamura, (2017)
- More ...
-
Bortfeldt, Andreas, (2010)
-
Bortfeldt, Andreas, (2010)
-
Bortfeldt, Andreas, (2010)
- More ...