A bi-objective guillotine cutting problem of stamping strips of equal circles

DOI10.1080/00207160902745325zbMath1198.90116MaRDI QIDQ3056407

Yaodong Cui, Wei Hu, Tianlong Gu

Publication date: 12 November 2010

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160902745325

zbMATH Keywords

circle packing; recursive algorithm; two-dimensional cutting; stamping strips

Mathematics Subject Classification ID

90C29: Multi-objective and goal programming

90B30: Production models

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
• Approximate algorithms for constrained circular cutting problems
• Continued fractions in optimal cutting of a rectangular sheet into equal small rectangles
• Packing equal circles in a square: A deterministic global optimization approach
• A mathematical model and a solution method for the problem of placing various-sized circles into a strip
• 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
• Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints
• Multistage Cutting Stock Problems of Two and More Dimensions
• The Theory and Computation of Knapsack Functions
• Exact algorithms for large-scale unconstrained two and three staged cutting problems