Simplest optimal cutting patterns for equal rectangles

DOI10.1016/J.ORL.2005.10.007zbMATH Open1112.90100OpenAlexW2024470714MaRDI QIDQ867922FDOQ867922

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

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

zbMATH Keywords

optimizationcutting stock problemtwo-dimensional cutting

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (12)

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

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)