An extended model formulation for the two-dimensional irregular strip packing problem considering general industry-relevant aspects

DOI10.1016/j.ejor.2022.07.050MaRDI QIDQ6106774

Hédi Király, Alf Kimms

Publication date: 3 July 2023

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

packingcuttingnesting problemirregular strip packing problemdirect trigonometry

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (1)

Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts

Cites Work

• Robust mixed-integer linear programming models for the irregular strip packing problem
• A practical algorithm for decomposing polygonal domains into convex polygons by diagonals
• On genetic algorithms for the packing of polygons
• Applied simulated annealing
• TOPOS -- A new constructive algorithm for nesting problems
• A clique covering MIP model for the irregular strip packing problem
• Algorithms for the decomposition of a polygon into convex polygons
• Mixed-integer programming models for nesting problems
• Irregular packing problems: a review of mathematical models
• Using a tabu search approach for solving the two-dimensional irregular cutting problem
• The geometry of nesting problems: a tutorial
• An improved typology of cutting and packing problems
• A tutorial in irregular shape packing problems
• Modeling of packing problems

This page was built for publication: An extended model formulation for the two-dimensional irregular strip packing problem considering general industry-relevant aspects