Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation

We investigate several two-dimensional guillotine cutting stock problems and their variants in which orthogonal rotations are allowed. We first present two dynamic programming based algorithms for the Rectangular Knapsack (RK) problem and its variants in which the patterns must be staged. The first...

Full description

Saved in:

Bibliographic Details
Published in:	European journal of operational research Vol. 191; no. 1; pp. 61 - 85
Main Authors:	Cintra, G.F., Miyazawa, F.K., Wakabayashi, Y., Xavier, E.C.
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 16-11-2008 Elsevier
Series:	European Journal of Operational Research
Subjects:	Applied sciences Column generation Cutting stock Dynamic programming Exact sciences and technology Flows in networks. Combinatorial problems Guillotine cutting Operational research and scientific management Operational research. Management science Strip packing Two-dimensional packing Two-dimensional packing Cutting stock Column generation Dynamic programming Strip packing Guillotine cutting Recurrence Cutting stock problem Bin packing problem Polynomial method Rotation Knapsack problem Polynomial time Packing
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!