A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
Year of publication: |
2008
|
---|---|
Authors: | Cui, Yaodong ; Yang, Yuli ; Cheng, Xian ; Song, Peihua |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 35.2008, 4, p. 1281-1291
|
Subject: | Algorithmus | Algorithm | Packproblem | Packing problem | Branch-and-Bound | Branch and Bound | Theorie | Theory |
-
Bin packing problem with time lags
Rivera Letelier, Orlando, (2022)
-
Yoon, K., (2013)
-
Exact approaches for the unconstrained two-dimensional cutting problem with defects
Zhang, Hao, (2023)
- More ...
-
A heuristic for the one-dimensional cutting stock problem with usable leftover
Cui, Yaodong, (2010)
-
On the bicriterion – minimal cost/minimal label – spanning tree problem
Cui, Yaodong, (2010)
-
A heuristic for the one-dimensional cutting stock problem with usable leftover
Cui, Yaodong, (2010)
- More ...