Simplest optimal cutting patterns for equal rectangles

DOI10.1016/J.ORL.2005.10.007MaRDI QIDQ867922zbMATHOpenAlexFDO

Authors 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)

Recommendations

• Dynamic programming algorithms for the optimal cutting of equal rectangles
• Generating optimal cutting patterns for rectangular blanks of a single size
• Simple block patterns for the two-dimensional cutting problem
• scientific article; zbMATH DE number 166938
• Bounds for Two-Dimensional Cutting

Cites work

• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• A Polynomial Time Algorithm For The Guillotine Pallet Loading Problem
• A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
• A typology of cutting and packing problems
• An application of simulated annealing to the cutting stock problem
• Continued fractions in optimal cutting of a rectangular sheet into equal small rectangles
• Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
• Generating optimal cutting patterns for rectangular blanks of a single size
• 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

Cited in

(12)

• scientific article; zbMATH DE number 3867069 (Why is no real title available?)
• Optimal cutting directions and rectangle orientation algorithm
• Renovation of the cutting stock process
• Integrated optimization of mixed cargo packing and cargo location assignment in automated storage and retrieval systems
• Generating optimal two-section cutting patterns for rectangular blanks
• Cutting rectangles avoiding rectangular defects
• Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid Grids
• scientific article; zbMATH DE number 166938 (Why is no real title available?)
• A fast algorithm for cutting a rectangle into equal rectangular pieces
• Continued fractions in optimal cutting of a rectangular sheet into equal small rectangles
• Dynamic programming algorithms for the optimal cutting of equal rectangles
• Simplest optimal guillotine cutting patterns for strips of identical circles

Describes a project that uses

Uses Software

• Knapsack

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q867922)