Robust mixed-integer linear programming models for the irregular strip packing problem
Year of publication: |
16 September 2016
|
---|---|
Authors: | Cherri, Luiz H. ; Mundim, Leandro R. ; Andretta, Marina ; Toledo, Franklina Maria Bragion de ; Oliveira, José F. ; Carravilla, Mario Antónia |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 253.2016, 3 (16.9.), p. 570-583
|
Subject: | Packing | Cutting | Nesting | MIP models | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Packproblem | Packing problem | Algorithmus | Algorithm |
-
Lastra-Díaz, Juan J., (2024)
-
A branch & bound algorithm for cutting and packing irregularly shaped pieces
Alvarez-Valdes, Ramon, (2013)
-
Algorithms for the one-dimensional two-stage cutting stock problem
Muter, İbrahim, (2018)
- More ...
-
A general heuristic for two-dimensional nesting problems with limited-size containers
Mundin, Leandro R., (2018)
-
Oliveira, Beatriz Brito, (2014)
-
A semi-continuous MIP model for the irregular strip packing problem
Leao, Aline A. S., (2016)
- More ...