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 | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Branch-and-Bound | Branch and Bound |
-
Ozturk, Onur, (2017)
-
Exact algorithms for the solution of the grey pattern quadratic assignment problem
Drezner, Zvi, (2015)
-
How important are branching decisions : fooling MIP solvers
Le Bodic, Pierre, (2015)
- More ...
-
An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems
Kang, M., (2011)
-
An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems
Kang, M., (2011)
-
Yoon, K., (2013)
- More ...