An improved best-first branch-and-bound algorithm for constrained two-dimensional guillotine cutting problems
| Year of publication: |
2013
|
|---|---|
| Authors: | Yoon, K. ; Ahn, Suck-kyo ; Kang, M. |
| Published in: |
International journal of production research. - London : Taylor & Francis, ISSN 0020-7543, ZDB-ID 160477-6. - Vol. 51.2013, 6 (15.3.), p. 1680-1693
|
| Subject: | branch and bound | constrained two-dimensional cutting | cutting problem | guillotine cutting pattern | optimisation | Mathematische Optimierung | Mathematical programming | Branch-and-Bound | Branch and Bound | Algorithmus | Algorithm | Packproblem | Packing problem | Theorie | Theory |
-
Bin packing problem with time lags
Rivera Letelier, Orlando, (2022)
-
Russo, Mauro, (2013)
-
A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
Alves, Cláudio, (2008)
- More ...
-
An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems
Kang, M., (2011)
-
Yoon, K., (2013)
-
An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems
Kang, M., (2011)
- More ...