A branch & bound algorithm for cutting and packing irregularly shaped pieces
Year of publication: |
2013
|
---|---|
Authors: | Alvarez-Valdes, Ramon ; Martinez, A. ; Tamarit, J. M. |
Published in: |
International journal of production economics. - Amsterdam [u.a.] : Elsevier, ISSN 0925-5273, ZDB-ID 1092526-0. - Vol. 145.2013, 2, p. 463-477
|
Subject: | Cutting & packing | Nesting | Integer formulation | Branch & bound | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Packproblem | Packing problem | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Branch-and-Bound | Branch and Bound |
-
The parallel stack loading problem of minimizing the exact number of relocations
Tanaka, Shunji, (2024)
-
LP bounds in various constraint programming approaches for orthogonal packing
Mesyagutov, Marat, (2012)
-
A parallel branch-and-bound approach to the rectangular guillotine strip cutting Problem
Bak, Slawomir, (2011)
- More ...
-
A maximal-space algorithm for the container loading problem
Parreño, F., (2008)
-
A branch and bound algorithm for the strip packing problem
Alvarez-Valdes, Ramon, (2009)
-
Neighborhood structures for the container loading problem : a VNS implementation
Parreño, F., (2010)
- More ...