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 | Operations Research | Operations research | Ganzzahlige Optimierung | Integer programming | Algorithmus | Algorithm | Packproblem | Packing problem | Branch-and-Bound | Branch and Bound |
-
Robust mixed-integer linear programming models for the irregular strip packing problem
Cherri, Luiz H., (2016)
-
A semi-continuous MIP model for the irregular strip packing problem
Leao, Aline A. S., (2016)
-
Bin packing problem with time lags
Rivera Letelier, Orlando, (2022)
- More ...
-
A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
Parreño, F., (2010)
-
Neighborhood structures for the container loading problem : a VNS implementation
Parreño, F., (2010)
-
Alvarez-Valdes, Ramon, (2013)
- More ...