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

DOI10.1007/S10898-018-0638-XMaRDI QIDQ1756757zbMATH OpenOpenAlexWikidataFDO

Authors Luiz H. Cherri, Adriana Cristina Cherri, E. 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)

Recommendations

• Robust mixed-integer linear programming models for the irregular strip packing problem
• A clique covering MIP model for the irregular strip packing problem
• An optimization model for the strip-packing problem and its augmented Lagrangian method
• A nonlinear programming model for two-dimensional strip-packing problem and its numerical method
• An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
• Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
• An extended model formulation for the two-dimensional irregular strip packing problem considering general industry-relevant aspects
• Mixed-integer DC programming based algorithms for the circular packing problem
• A mixed-integer model for two-dimensional polyominoes strip packing and tiling problems
• Solving the irregular strip packing problem via guided local search for overlap minimization

Cites work

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

Cited in

(11)

• Matheuristics for the irregular bin packing problem with free rotations
• An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry
• An extended model formulation for the two-dimensional irregular strip packing problem considering general industry-relevant aspects
• A mixed-integer model for two-dimensional polyominoes strip packing and tiling problems
• A clique covering MIP model for the irregular strip packing problem
• Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts
• Irregular packing problems: a review of mathematical models
• Decomposition algorithm for irregular placement problems
• Heuristics for the two-dimensional irregular bin packing problem with limited rotations
• Robust mixed-integer linear programming models for the irregular strip packing problem
• Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem

Describes a project that uses

Uses Software

• TOPOS
• GAMS

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1756757)