A customized branch-and-bound approach for irregular shape nesting

DOI10.1007/s10898-018-0637-yzbMath1405.90113OpenAlexW2792533437MaRDI QIDQ1668808

Chrysanthos E. Gounaris, Christopher L. Hanselman, Akang Wang

Publication date: 29 August 2018

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

Full work available at URL: https://doi.org/10.1007/s10898-018-0637-y

zbMATH Keywords

global optimizationnesting problemirregular strip packingreverse convex quadratic constraints

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27)

Related Items (8)

Heuristics for the two-dimensional irregular bin packing problem with limited rotations ⋮ 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 ⋮ Irregular packing problems: a review of mathematical models ⋮ On tackling reverse convex constraints for non-overlapping of unequal circles ⋮ Raster penetration map applied to the irregular packing problem

Uses Software

• SCIP
• TOPOS
• LINDO
• GloMIQO

Cites Work

• Unnamed Item
• Robust mixed-integer linear programming models for the irregular strip packing problem
• GLOMIQO: global mixed-integer quadratic optimizer
• SCIP: solving constraint integer programs
• Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
• Solving circle packing problems by global optimization: numerical results and industrial applications
• Reactive GRASP for the strip-packing problem
• Reverse convex programming
• Rotational polygon containment and minimum enclosure using only robust 2D constructions
• TOPOS -- A new constructive algorithm for nesting problems
• A review of the application of meta-heuristic algorithms to 2D strip packing problems
• A polyhedral branch-and-cut approach to global optimization
• A fully general, exact algorithm for nesting irregular shapes
• Mixed-integer programming models for nesting problems
• The geometry of nesting problems: a tutorial
• A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
• An improved typology of cutting and packing problems
• A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem

This page was built for publication: A customized branch-and-bound approach for irregular shape nesting