A fully general, exact algorithm for nesting irregular shapes

DOI10.1007/s10898-013-0129-zzbMath1298.90087OpenAlexW2043069749MaRDI QIDQ2250088

Donald R. Jones

Publication date: 4 July 2014

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-013-0129-z

zbMATH Keywords

global optimizationinner approximationquadratic programmingrotationtranslationcutting and packingnonconvex polygoninscribed circleirregular shapefabric nestingguaranteed optimalityleather nesting

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Combinatorial optimization (90C27)

Related Items (13)

A customized branch-and-bound approach for irregular shape nesting ⋮ Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 ⋮ Packing ellipsoids in an optimized cylinder ⋮ Packing convex polygons in minimum-perimeter convex hulls ⋮ Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts ⋮ Decomposition Algorithm for Irregular Placement Problems ⋮ Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem ⋮ Descending packing algorithm for irregular graphics based on geometric feature points ⋮ Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations ⋮ Irregular packing problems: a review of mathematical models ⋮ On tackling reverse convex constraints for non-overlapping of unequal circles ⋮ Optimized packing clusters of objects in a rectangular container ⋮ Raster penetration map applied to the irregular packing problem

Uses Software

• BARON
• GloMIQO

Cites Work

• GLOMIQO: global mixed-integer quadratic optimizer
• Complete and robust no-fit polygon generation for the irregular stock cutting problem
• Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet
• Cutting circles and polygons from area-minimizing rectangles
• Solution approaches to irregular nesting problems
• Compaction and separation algorithms for non-convex polygons and their applications
• An analytical expression and an algorithm for the volume of a convex polyhedron in \(R^ n\).
• Rotational polygon containment and minimum enclosure using only robust 2D constructions
• Densest translational lattice packing of non-convex polygons
• BARON: A general purpose global optimization software package
• Cutting ellipses from area-minimizing rectangles
• A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
• A tutorial in irregular shape packing problems
• Polygon placement under translation and rotation
• [NO TITLE AVAILABLE]
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A fully general, exact algorithm for nesting irregular shapes