A heuristic for the one-dimensional cutting stock problem with usable leftover
Year of publication: |
2010
|
---|---|
Authors: | Cui, Yaodong ; Yang, Yuli |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 204.2010, 2 (16.7.), p. 245-250
|
Subject: | Heuristik | Heuristics | Packproblem | Packing problem | Theorie | Theory |
-
Gil, Alejandro Fernández, (2023)
-
A column generation-based heuristic for the three-dimensional bin packing problem with rotation
Mahvash, Batoul, (2018)
-
Trigos, Federico, (2020)
- More ...
-
A heuristic for the one-dimensional cutting stock problem with usable leftover
Cui, Yaodong, (2010)
-
On the bicriterion – minimal cost/minimal label – spanning tree problem
Cui, Yaodong, (2010)
-
A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
Cui, Yaodong, (2008)
- More ...