An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems

In the unconstrained two-dimensional cutting problems (U2DCP) small rectangular objects have to be extracted from a large rectangular sheet, with no limits on the number of small objects. The exact U2DCP solving approaches present in literature show some limits in tackling very large size instances,...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Computers & operations research Ročník 50; s. 97 - 114
Hlavní autori:	Russo, Mauro, Sforza, Antonio, Sterle, Claudio
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Kidlington Elsevier Ltd 01.10.2014 Elsevier Pergamon Press Inc
Predmet:	Algorithms Applied sciences Computation Cutting Dynamic programming Exact sciences and technology Flows in networks. Combinatorial problems Guillotine cutting Knapsack function Knapsack problem Mathematical analysis Mathematical models Mathematical problems Mathematical programming Operational research and scientific management Operational research. Management science Optimization Proof theory Studies Two dimensional Knapsack function Guillotine cutting Dynamic programming Refinement method Cutting stock problem Redundancy Large scale Combinatorial optimization Knapsack problem
ISSN:	0305-0548, 1873-765X, 0305-0548
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!