Recommendations
Cites work
- A 2-exchange heuristic for nesting problems
- A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
- A beam search implementation for the irregular shape packing problem
- A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
- A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms
- An improved typology of cutting and packing problems
- Applied simulated annealing
- Benders decomposition, Lagrangean relaxation and metaheuristic design
- Complete and robust no-fit polygon generation for the irregular stock cutting problem
- Determining the minimum-area encasing rectangle for an arbitrary closed curve
- Exact solution of the two-dimensional finite bin packing problem
- Fast neighborhood search for two- and three-dimensional nesting problems
- Guided Local Search
- Irregular packing using the line and arc no-fit polygon
- Jostling for position: local improvement for irregular cutting patterns
- Mathematical model and efficient algorithms for object packing problem
- New approaches for the nesting of two-dimensional shapes for press tool design
- On genetic algorithms for the packing of polygons
- Solution approaches to irregular nesting problems
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
- TOPOS -- A new constructive algorithm for nesting problems
- The geometry of nesting problems: a tutorial
- The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
- The nesting problem in the leather manufacturing industry
- The two-dimensional finite bin packing problem. II: New lower and upper bounds
- Two-Dimensional Finite Bin-Packing Algorithms
- Using a tabu search approach for solving the two-dimensional irregular cutting problem
- \(\Phi\)-functions for complex 2D-objects
Cited in
(22)- A variable neighborhood search algorithm for the leather nesting problem
- Descending packing algorithm for irregular graphics based on geometric feature points
- scientific article; zbMATH DE number 437550 (Why is no real title available?)
- Rectangle blanket problem: binary integer linear programming formulation and solution algorithms
- Solving the parallel processor scheduling and bin packing problems with contiguity constraints: mathematical models and computational studies
- Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem
- A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands
- Decomposition algorithm for irregular placement problems
- The nesting problem in the leather manufacturing industry
- Irregular packing problems: a review of mathematical models
- Robust mixed-integer linear programming models for the irregular strip packing problem
- Fast neighborhood search for two- and three-dimensional nesting problems
- Exact approaches for the cutting path determination problem
- Solving two-dimensional cutting stock problem via a DNA computing algorithm
- Two-dimensional bin packing, cutting stock, and open dimension problems: a survey of practical requirements
- Using helical polyhedron for online irregular strip packing problem with free rotations
- Heuristics for the two-dimensional irregular bin packing problem with limited rotations
- Irregular stock cutting system based on AutoCAD
- A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation
- TOPOS -- A new constructive algorithm for nesting problems
- A new branch-and-cut approach for integrated planning in additive manufacturing
- An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry
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)
