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,...

Full description

Saved in:

Bibliographic Details
Published in:	Computers & operations research Vol. 50; pp. 97 - 114
Main Authors:	Russo, Mauro, Sforza, Antonio, Sterle, Claudio
Format:	Journal Article
Language:	English
Published:	Kidlington Elsevier Ltd 01.10.2014 Elsevier Pergamon Press Inc
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!