Simplest optimal cutting patterns for equal rectangles

DOI10.1016/J.ORL.2005.10.007zbMath1112.90100OpenAlexW2024470714MaRDI QIDQ867922

Yaodong Cui

Publication date: 19 February 2007

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2005.10.007

zbMATH Keywords

optimizationcutting stock problemtwo-dimensional cutting

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (2)

Renovation of the cutting stock process ⋮ Integrated optimization of mixed cargo packing and cargo location assignment in automated storage and retrieval systems

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Minimizing trim loss in cutting rectangular blanks of a single size from a rectangular sheet using orthogonal guillotine cuts
• An application of simulated annealing to the cutting stock problem
• Unbounded knapsack problem: Dynamic programming revisited
• Continued fractions in optimal cutting of a rectangular sheet into equal small rectangles
• A typology of cutting and packing problems
• Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
• Generating optimal cutting patterns for rectangular blanks of a single size
• A Polynomial Time Algorithm For The Guillotine Pallet Loading Problem
• A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems

This page was built for publication: Simplest optimal cutting patterns for equal rectangles