Strips minimization in two-dimensional cutting stock of circular items

DOI10.1016/j.cor.2009.06.005zbMath1175.90298OpenAlexW2075677855MaRDI QIDQ1040959

Dao-Yun Xu, Yaodong Cui

Publication date: 27 November 2009

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

Full work available at URL: https://doi.org/10.1016/j.cor.2009.06.005

zbMATH Keywords

cutting stocktwo-dimensional cuttingstamping stripsstrips minimization

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Linear programming (90C05)

Related Items

High density packings of equal circles in rectangles with variable aspect ratio ⋮ A cutting stock problem in the wood products industry: a two‐stage solution approach ⋮ Reducing the number of cuts in generating three-staged cutting patterns ⋮ Optimized packing multidimensional hyperspheres: a unified approach ⋮ Maximizing the sum of radii of balls inscribed in a polyhedral set ⋮ Linear models for the approximate solution of the problem of packing equal circles into a given domain

Cites Work

• Unnamed Item
• Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
• A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
• Cutting stock problems and solution procedures
• Heuristic and exact methods for the cutting sequencing problem
• A hybrid approach for optimization of one-dimensional cutting
• A method for solving the minimization of the maximum number of open stacks problem within a cutting process
• Generating optimal T-shape cutting patterns for circular blanks
• Pattern minimisation in cutting stock problems
• New resolution algorithm and pretreatments for the two-dimensional bin-packing problem
• A hybrid heuristic to reduce the number of different patterns in cutting stock problems
• Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors
• An improved typology of cutting and packing problems
• An integrated cutting stock and sequencing problem
• A two-dimensional strip cutting problem with sequencing constraint
• Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting
• Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
• Pattern reduction in one-dimensional cutting stock problems
• Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem