Generating optimal T-shape cutting patterns for circular blanks

DOI10.1016/S0305-0548(03)00208-9zbMath1076.90560OpenAlexW2026547815MaRDI QIDQ1886734

Yaodong Cui

Publication date: 19 November 2004

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(03)00208-9

zbMATH Keywords

Cutting stock problemTwo-dimensional cuttingSilicon steel sheet

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Combinatorial optimization (90C27)

Related Items (12)

Exact algorithm for generating two-segment cutting patterns of punched strips ⋮ A simple algorithm for generating optimal equal circle cutting patterns with minimum sections ⋮ A literature review on circle and sphere packing problems: models and methodologies ⋮ Approximation schemes for covering and packing problems in image processing and VLSI ⋮ Valid constraints for the Point Packing in a Square problem ⋮ Simplest optimal guillotine cutting patterns for strips of identical circles ⋮ Solving circle packing problems by global optimization: numerical results and industrial applications ⋮ Recursive algorithm for the two‐dimensional cutting problem of punched strips ⋮ A bi-objective guillotine cutting problem of stamping strips of equal circles ⋮ A note on linear models for two-group and three-group two-dimensional guillotine cutting problems ⋮ Dynamic programming algorithms for generating optimal strip layouts ⋮ Strips minimization in two-dimensional cutting stock of circular items

Cites Work

• Unnamed Item
• An optimal algorithm for rectangle placement
• Continued fractions in optimal cutting of a rectangular sheet into equal small rectangles
• A Linear Programming Approach to the Cutting-Stock Problem
• The Theory and Computation of Knapsack Functions

This page was built for publication: Generating optimal T-shape cutting patterns for circular blanks