Strips minimization in two-dimensional cutting stock of circular items
From MaRDI portal
Publication:1040959
DOI10.1016/J.COR.2009.06.005zbMATH Open1175.90298OpenAlexW2075677855MaRDI QIDQ1040959FDOQ1040959
Authors: Yaodong Cui, Daoyun Xu 
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
Recommendations
- A bi-objective guillotine cutting problem of stamping strips of equal circles
- A simple algorithm for generating optimal equal circle cutting patterns with minimum sections
- scientific article; zbMATH DE number 5299948
- Using layer patterns in solving the two-dimensional cutting stock problem
- Simplest optimal guillotine cutting patterns for strips of identical circles
Cites Work
- Title not available (Why is that?)
- An improved typology of cutting and packing problems
- A hybrid heuristic to reduce the number of different patterns in cutting stock problems
- Pattern reduction in one-dimensional cutting stock problems
- Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
- Cutting stock problems and solution procedures
- Pattern minimisation in cutting stock problems
- An integrated cutting stock and sequencing problem
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
- New resolution algorithm and pretreatments for the two-dimensional bin-packing 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
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
- Generating optimal T-shape cutting patterns for circular blanks
- A method for solving the minimization of the maximum number of open stacks problem within a cutting process
- A hybrid approach for optimization of one-dimensional cutting
- Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors
- Heuristic and exact methods for the cutting sequencing problem
Cited In (9)
- Linear models for the approximate solution of the problem of packing equal circles into a given domain
- Optimized packing multidimensional hyperspheres: a unified approach
- A bi-objective guillotine cutting problem of stamping strips of equal circles
- 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
- A simple algorithm for generating optimal equal circle cutting patterns with minimum sections
- Maximizing the sum of radii of balls inscribed in a polyhedral set
- High density packings of equal circles in rectangles with variable aspect ratio
- Simplest optimal guillotine cutting patterns for strips of identical circles
This page was built for publication: Strips minimization in two-dimensional cutting stock of circular items
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1040959)
