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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	European journal of operational research Ročník 191; číslo 1; s. 61 - 85
Hlavní autoři:	Cintra, G.F., Miyazawa, F.K., Wakabayashi, Y., Xavier, E.C.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 16.11.2008 Elsevier
Edice:	European Journal of Operational Research
Témata:	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
ISSN:	0377-2217, 1872-6860
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!