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: | Mathematische Optimierung | Mathematical programming | Heuristik | Heuristics | USA | United States | Theorie | Theory | Packproblem | Packing problem |
-
The one-dimensional cutting stock problem with usable leftover : a heuristic approach
Cherri, Adriana Cristina, (2009)
-
Heuristics for the variable sized bin-packing problem
Haouari, Mohamed, (2009)
-
Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem
Fleszar, Krzysztof, (2011)
- More ...
-
A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
Cui, Yaodong, (2008)
-
On the bicriterion – minimal cost/minimal label – spanning tree problem
Cui, Yaodong, (2010)
-
A heuristic for the one-dimensional cutting stock problem with usable leftover
Cui, Yaodong, (2010)
- More ...