Solution approaches to irregular nesting problems
From MaRDI portal
Recommendations
- The geometry of nesting problems: a tutorial
- Irregular packing problems: a review of mathematical models
- Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet
- The irregular nesting problem involving triangles and rectangles
- scientific article; zbMATH DE number 2111993
Cites work
- scientific article; zbMATH DE number 437550 (Why is no real title available?)
- scientific article; zbMATH DE number 3890754 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 1488569 (Why is no real title available?)
- scientific article; zbMATH DE number 3300294 (Why is no real title available?)
- Applied simulated annealing
- Composite stock cutting through simulated annealing
- Determining the minimum-area encasing rectangle for an arbitrary closed curve
- Jostling for position: local improvement for irregular cutting patterns
- Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem
- Modeling of packing problems
- New approaches for the nesting of two-dimensional shapes for press tool design
- Packing problems
- Performance testing of rectangular parts-nesting heuristics
- Using a tabu search approach for solving the two-dimensional irregular cutting problem
Cited in
(39)- Irregular packing: MILP model based on a polygonal enclosure
- Packaging optimization using the dynamic vector fields method
- Exact solution techniques for two-dimensional cutting and packing
- A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems
- A new algorithm for the two-polygon containment problem
- Solving nesting problems with non-convex polygons by constraint logic programming
- Covering polygons with rectangles
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
- Rectangle blanket problem: binary integer linear programming formulation and solution algorithms
- Alternative formulations for a layout problem in the fashion industry
- A simulated annealing approach to the nesting problem in the textile manufacturing industry
- Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning
- scientific article; zbMATH DE number 2111993 (Why is no real title available?)
- A tutorial in irregular shape packing problems
- Cut scheduling in the apparel industry
- The irregular nesting problem involving triangles and rectangles
- A clique covering MIP model for the irregular strip packing problem
- Irregular packing problems: a review of mathematical models
- Densest translational lattice packing of non-convex polygons
- Mixed-integer programming models for nesting problems
- Algorithms for nesting with defects
- Fast neighborhood search for two- and three-dimensional nesting problems
- An effective heuristic for the two-dimensional irregular bin packing problem
- A customized branch-and-bound approach for irregular shape nesting
- Translational packing of arbitrary polytopes
- Rotational polygon overlap minimization and compaction
- Algorithm for 2D irregular-shaped nesting problem based on the NFP algorithm and lowest-gravity-center principle
- Optimal clustering of a pair of irregular objects
- Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts
- A hybrid approach for packing irregular patterns using evolutionary strategies and neural network
- Optimal routing in problemsof sequential traversal of megapolises in the presence of constraints
- Heuristics for a dynamic rural postman problem
- A fully general, exact algorithm for nesting irregular shapes
- The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
- Computing closely matching upper and lower bounds on textile nesting problems
- A simulated annealing approach for the circular cutting problem
- An object-based evolutionary algorithm for solving nesting problems
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering
This page was built for publication: Solution approaches to irregular nesting problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127203)
