An improvement of the knapsack function based algorithm of Gilmore and Gomory for the unconstrained two-dimensional guillotine cutting problem
Year of publication: |
2013
|
---|---|
Authors: | Russo, Mauro ; Sforza, Antonio ; Sterle, Claudio |
Published in: |
International journal of production economics. - Amsterdam [u.a.] : Elsevier, ISSN 0925-5273, ZDB-ID 1092526-0. - Vol. 145.2013, 2, p. 451-462
|
Subject: | Cutting stock | Guillotine cutting | Knapsack function | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Algorithmus | Algorithm | Packproblem | Packing problem | Branch-and-Bound | Branch and Bound | Operations Research | Operations research |
-
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)
-
Bin packing and cutting stock problems : mathematical models and exact algorithms
Delorme, Maxence, (2016)
- More ...
-
Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
Russo, Mauro, (2019)
-
Russo, Mauro, (2013)
-
Russo, Mauro, (2013)
- More ...