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 | Branch-and-Bound | Branch and Bound | Heuristik | Heuristics | Ganzzahlige Optimierung | Integer programming | USA | United States | Theorie | Theory | Packproblem | Packing problem |
-
LP bounds in various constraint programming approaches for orthogonal packing
Mesyagutov, Marat, (2012)
-
Wei, Lijun, (2018)
-
A branch & bound algorithm for cutting and packing irregularly shaped pieces
Alvarez-Valdes, Ramon, (2013)
- More ...
-
A Parallel Branch-and-Bound Approach to the Rectangular Guillotine Strip Cutting Problem
Bak, Slawomir, (2011)
-
An integrated model for the transshipment yard scheduling problem
Cichenski, Mateusz, (2017)
-
Unified encoding for hyper-heuristics with application to bioinformatics
Swiercz, Aleksandra, (2014)
- More ...