The geometry of nesting problems: a tutorial
From MaRDI portal
Publication:2384608
DOI10.1016/j.ejor.2006.11.038zbMath1136.90030OpenAlexW2010017787MaRDI QIDQ2384608
José Fernando Oliveira, Julia A. Bennell
Publication date: 10 October 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.11.038
Applications of mathematical programming (90C90) Combinatorial optimization (90C27) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items (41)
Quasi-phi-functions and optimal packing of ellipses ⋮ Robust mixed-integer linear programming models for the irregular strip packing problem ⋮ A clique covering MIP model for the irregular strip packing problem ⋮ Aircraft parking stand allocation problem with safety consideration for independent hangar maintenance service providers ⋮ Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes ⋮ An effective heuristic for the two-dimensional irregular bin packing problem ⋮ A customized branch-and-bound approach for irregular shape nesting ⋮ Packing ovals in optimized regular polygons ⋮ An emergent computation approach to the problem of polygon layout with performance constraints ⋮ Extracting maximal objects from three-dimensional solid materials ⋮ A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands ⋮ Packing convex polygons in minimum-perimeter convex hulls ⋮ Algorithms for nesting with defects ⋮ Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts ⋮ An extended model formulation for the two-dimensional irregular strip packing problem considering general industry-relevant aspects ⋮ Model development and solver demonstrations using randomized test problems ⋮ A heuristic approach for packing identical rectangles in convex regions ⋮ Phi-functions for 2D objects formed by line segments and circular arcs ⋮ A family of heuristic-based inequalities for maximizing overall safety margins in aircraft parking stands arrangement problems ⋮ Decomposition algorithm for geometric objects in 2D packing and cutting problems ⋮ Irregular stock cutting system based on AutoCAD ⋮ Rectangle blanket problem: binary integer linear programming formulation and solution algorithms ⋮ Matheuristics for the irregular bin packing problem with free rotations ⋮ Packing of concave polyhedra with continuous rotations using nonlinear optimisation ⋮ Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations ⋮ Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem ⋮ Packing different cuboids with rotations and spheres into a cuboid ⋮ Mathematical modeling of the interaction of non-oriented convex polytopes ⋮ Mathematical model and efficient algorithms for object packing problem ⋮ Optimal clustering of a pair of irregular objects ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ Irregular packing problems: a review of mathematical models ⋮ Foldabilizing furniture ⋮ Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry ⋮ Near optimal minimal convex hulls of disks ⋮ A mathematical model and algorithms for the aircraft hangar maintenance scheduling problem ⋮ Raster penetration map applied to the irregular packing problem ⋮ Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications ⋮ Irregular packing: MILP model based on a polygonal enclosure ⋮ A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation ⋮ Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
Cites Work
- Unnamed Item
- Unnamed Item
- A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms
- Compaction and separation algorithms for non-convex polygons and their applications
- Applied simulated annealing
- The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
- A typology of cutting and packing problems
- \(\Phi\)-functions for complex 2D-objects
- A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
- An algebra of polygons through the notion of negative shapes
- Bounds for Two-Dimensional Cutting
- A new upper bound for unconstrained two-dimensional cutting and packing
- Analysis of upper bounds for the pallet loading problem
- Polygon decomposition for efficient construction of Minkowski sums
This page was built for publication: The geometry of nesting problems: a tutorial
