Simplest optimal guillotine cutting patterns for strips of identical circles

DOI10.1007/s10878-007-9089-xzbMath1145.90459OpenAlexW2020414059MaRDI QIDQ927192

Wei Hu, Tianlong Gu, Yaodong Cui

Publication date: 4 June 2008

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-007-9089-x

zbMATH Keywords

AlgorithmsDynamic programmingCADCirclesTwo-dimensional cutting

Mathematics Subject Classification ID

Production models (90B30) Dynamic programming (90C39)

Related Items (1)

A simple algorithm for generating optimal equal circle cutting patterns with minimum sections

Cites Work

• Minimizing trim loss in cutting rectangular blanks of a single size from a rectangular sheet using orthogonal guillotine cuts
• Packing different-sized circles into a rectangular container
• Continued fractions in optimal cutting of a rectangular sheet into equal small rectangles
• Generating optimal T-shape cutting patterns for circular blanks
• Exact and heuristic algorithms for the circle cutting problem in the manufacturing industry of electric motors
• Dynamic programming algorithms for the optimal cutting of equal rectangles
• Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors
• A Polynomial Time Algorithm For The Guillotine Pallet Loading Problem

This page was built for publication: Simplest optimal guillotine cutting patterns for strips of identical circles