Dynamic programming algorithms for generating optimal strip layouts

DOI10.1007/s10589-005-3067-yzbMath1111.90116OpenAlexW2035215588MaRDI QIDQ2506184

Yaodong Cui, Ling Huang

Publication date: 28 September 2006

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-005-3067-y

zbMATH Keywords

CADtwo-dimensional cuttingguillotine cutsstrip layout

Mathematics Subject Classification ID

Dynamic programming (90C39)

Related Items

Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns ⋮ A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem

Uses Software

• TOPOS

Cites Work

• Unnamed Item
• A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms
• Minimizing trim loss in cutting rectangular blanks of a single size from a rectangular sheet using orthogonal guillotine cuts
• Unbounded knapsack problem: Dynamic programming revisited
• Continued fractions in optimal cutting of a rectangular sheet into equal small rectangles
• A cutting stock problem and its solution in the manufacturing industry of large electric generators
• A 2-exchange heuristic for nesting problems
• Generating optimal T-shape cutting patterns for circular blanks
• Generating optimal cutting patterns for rectangular blanks of a single size
• A Polynomial Time Algorithm For The Guillotine Pallet Loading Problem