Algorithms for nesting with defects
DOI10.1016/J.DAM.2012.03.026zbMATH Open1303.90084DBLPjournals/dam/BaldacciBGM14OpenAlexW2065009499WikidataQ59195720 ScholiaQ59195720MaRDI QIDQ406491FDOQ406491
Vittorio Maniezzo, Maurizio Ganovelli, Marco A. Boschetti, Roberto Baldacci
Publication date: 8 September 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.03.026
Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90) Combinatorial optimization (90C27)
Cites Work
- TOPOS -- A new constructive algorithm for nesting problems
- Solution approaches to irregular nesting problems
- On genetic algorithms for the packing of polygons
- A 2-exchange heuristic for nesting problems
- Mathematical model and efficient algorithms for object packing problem
- A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
- The geometry of nesting problems: a tutorial
- An improved typology of cutting and packing problems
- Fast neighborhood search for two- and three-dimensional nesting problems
- A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
- A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
- Complete and robust no-fit polygon generation for the irregular stock cutting problem
- A beam search implementation for the irregular shape packing problem
- Applied simulated annealing
- Irregular Packing Using the Line and Arc No-Fit Polygon
- Exact solution of the two-dimensional finite bin packing problem
- Two-Dimensional Finite Bin-Packing Algorithms
- The two-dimensional finite bin packing problem. II: New lower and upper bounds
- Benders decomposition, Lagrangean relaxation and metaheuristic design
- Determining the minimum-area encasing rectangle for an arbitrary closed curve
- The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
- Jostling for position: local improvement for irregular cutting patterns
- \(\Phi\)-functions for complex 2D-objects
- The nesting problem in the leather manufacturing industry
- Using a tabu search approach for solving the two-dimensional irregular cutting problem
- New approaches for the nesting of two-dimensional shapes for press tool design
- Guided Local Search
Cited In (13)
- Descending packing algorithm for irregular graphics based on geometric feature points
- Title not available (Why is that?)
- Rectangle blanket problem: binary integer linear programming formulation and solution algorithms
- Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem
- A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands
- Irregular packing problems: a review of mathematical models
- Robust mixed-integer linear programming models for the irregular strip packing problem
- Exact approaches for the cutting path determination problem
- Solving two-dimensional cutting stock problem via a DNA computing algorithm
- Heuristics for the two-dimensional irregular bin packing problem with limited rotations
- A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation
- An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry
- Decomposition Algorithm for Irregular Placement Problems
Uses Software
This page was built for publication: Algorithms for nesting with defects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q406491)
