A parallel branch-and-bound approach to the rectangular guillotine strip cutting Problem
| Year of publication: |
2011
|
|---|---|
| Authors: | Bak, Slawomir ; Błażewicz, Jacek ; Pawlak, Grzegorz ; Plaza, Maciej ; Burke, Edmund K. |
| Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 23.2011, 1, p. 15-25
|
| Subject: | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Branch-and-Bound | Branch and Bound | Packproblem | Packing problem |
-
Lower bounds for a bin packing problem with linear usage cost
Braune, Roland, (2019)
-
Bin packing problem with time lags
Rivera Letelier, Orlando, (2022)
-
Yoon, K., (2013)
- More ...
-
The simplified partial digest problem : approximation and a graph-theoretic model
Błażewicz, Jacek, (2011)
-
A simulated annealing hyper-heuristic methodology for flexible decision support
Bai, Ruibin, (2012)
-
Editorial: New branches, old roots
Błażewicz, Jacek, (2012)
- More ...