An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems
Year of publication: |
2011
|
---|---|
Authors: | Kang, M. ; Yoon, K. |
Published in: |
International journal of production research. - London : Taylor & Francis, ISSN 0020-7543, ZDB-ID 160477-6. - Vol. 49.2011, 15/17 (1/1.8/9.), p. 4437-4455
|
Subject: | Packproblem | Packing problem | Mathematische Optimierung | Mathematical programming | Branch-and-Bound | Branch and Bound | Algorithmus | Algorithm |
-
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 ...
-
Yoon, K., (2013)
-
An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems
Kang, M., (2011)
-
Yoon, K., (2013)
- More ...