Complete and robust no-fit polygon generation for the irregular stock cutting problem
From MaRDI portal
Publication:858412
DOI10.1016/J.EJOR.2006.03.011zbMATH Open1175.90325OpenAlexW1977402971MaRDI QIDQ858412FDOQ858412
Edmund K. Burke, R. S. R. Hellier, Glenn Whitwell, Graham Kendall
Publication date: 9 January 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.03.011
Recommendations
- The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
- The irregular nesting problem: a new approach for nofit polygon calculation
- On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns
- A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
- A local search approach for two-dimensional irregular cutting
- Generating Fenchel Cutting Planes for Knapsack Polyhedra
- An approximation algorithm for cutting out convex polygons
- scientific article; zbMATH DE number 2079417
- Exact approaches for the unconstrained two-dimensional cutting problem with defects
Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Mixed volumes and related topics in convex geometry (52A39) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cites Work
- Title not available (Why is that?)
- Compaction and separation algorithms for non-convex polygons and their applications
- A 2-exchange heuristic for nesting problems
- A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
- A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
- A typology of cutting and packing problems
- Computational Geometry in C
- Packing problems
- Modeling of packing problems
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
- An algorithm for polygon placement using a bottom-left strategy
- Jostling for position: local improvement for irregular cutting patterns
- Title not available (Why is that?)
- \(\Phi\)-functions for complex 2D-objects
- Rotational polygon containment and minimum enclosure using only robust 2D constructions
- Title not available (Why is that?)
- Polygon decomposition for efficient construction of Minkowski sums
- Title not available (Why is that?)
- A new algorithm for the minimal-area convex enclosure problem
- An algebra of polygons through the notion of negative shapes
- Title not available (Why is that?)
Cited In (27)
- Irregular packing: MILP model based on a polygonal enclosure
- Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry
- Dynamic pricing for vehicle ferries: using packing and simulation to optimize revenues
- Tools of mathematical modeling of arbitrary object packing problems
- Optimal decomposition approach for solving large nesting and scheduling problems of additive manufacturing systems
- The irregular nesting problem: a new approach for nofit polygon calculation
- Solving the irregular strip packing problem via guided local search for overlap minimization
- A beam search implementation for the irregular shape packing problem
- How to load your auto carrier. A hybrid packing approach for the auto-carrier loading problem
- Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning
- Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem
- A measure of non-convexity in the plane and the Minkowski sum
- Title not available (Why is that?)
- Aircraft parking stand allocation problem with safety consideration for independent hangar maintenance service providers
- Irregular packing problems: a review of mathematical models
- A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
- Algorithms for nesting with defects
- An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations
- An effective heuristic for the two-dimensional irregular bin packing problem
- An emergent computation approach to the problem of polygon layout with performance constraints
- An improved method for calculating the no-fit polygon
- A fully general, exact algorithm for nesting irregular shapes
- 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
- Irregular stock cutting system based on AutoCAD
- The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
- A family of heuristic-based inequalities for maximizing overall safety margins in aircraft parking stands arrangement problems
Uses Software
This page was built for publication: Complete and robust no-fit polygon generation for the irregular stock cutting problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q858412)
