A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
Year of publication: |
2008
|
---|---|
Authors: | Alves, Cláudio ; Valério de Carvalho, J. M. |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 35.2008, 4, p. 1315-1328
|
Subject: | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Packproblem | Packing problem | Branch-and-Bound | Branch and Bound |
-
Bin packing problem with time lags
Rivera Letelier, Orlando, (2022)
-
Yoon, K., (2013)
-
Exact approaches for the unconstrained two-dimensional cutting problem with defects
Zhang, Hao, (2023)
- More ...
-
Theoretical investigations on maximal dual feasible functions
Rietz, Jürgen, (2010)
-
New integer programming formulations and exact algorithm for the ordered cutting stock problem
Alves, Claudio, (2008)
-
Ramos, Bruna, (2020)
- More ...