New integer programming formulations and exact algorithm for the ordered cutting stock problem
Year of publication: |
2008
|
---|---|
Authors: | Alves, Claudio ; Valério de Carvalho, J. M. |
Published in: |
Journal of the Operational Research Society : OR. - Basingstoke, Hampshire : Palgrave, ISSN 0030-3623, ZDB-ID 716033-1. - Vol. 59.2008, 11, p. 1520-1531
|
Subject: | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | Algorithmus | Algorithm | Packproblem | Packing problem |
-
Bin packing problem with time lags
Rivera Letelier, Orlando, (2022)
-
Models for the two-dimensional level strip packing problem : a review and a computational evaluation
Bezerra, Vanessa M. R., (2020)
-
Temporal bin packing with half-capacity jobs
Muir, Christopher, (2024)
- More ...
-
Accelerating column generation for variable sized bin-packing problems
Alves, Claudio, (2007)
-
Theoretical investigations on maximal dual feasible functions
Rietz, Jürgen, (2010)
-
A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
Alves, Cláudio, (2008)
- More ...