Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations

DOI10.1007/s10898-018-0638-xzbMath1414.90234OpenAlexW2793304285WikidataQ130126072 ScholiaQ130126072MaRDI QIDQ1756757

Luiz H. Cherri, Adriana Cristina Cherri, Edilaine Martins Soler

Publication date: 21 December 2018

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

Full work available at URL: http://hdl.handle.net/11449/160523

zbMATH Keywords

mixed integer nonlinear programmingnesting problemscontinuous rotationsirregular pieces

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Related Items (5)

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 ⋮ Irregular packing problems: a review of mathematical models

Uses Software

• TOPOS
• GAMS

Cites Work

• Robust mixed-integer linear programming models for the irregular strip packing problem
• Cutting circles and polygons from area-minimizing rectangles
• Optimal packing and covering in the plane are NP-complete
• A 2-exchange heuristic for nesting problems
• Optimal clustering of a pair of irregular objects
• A fully general, exact algorithm for nesting irregular shapes
• Mathematical model and efficient algorithms for object packing problem
• Mixed-integer programming models for nesting problems
• A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering
• The geometry of nesting problems: a tutorial
• Solving nesting problems with non-convex polygons by constraint logic programming

This page was built for publication: Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations