.png){kind=icon}
.png){kind=icon}
Return
Mixed-integer linear programming models for 3D irregular strip packing problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2025.10.041.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
• We observe a lack of exact methods in the 3D irregular cutting and packing literature in comparison to the 2D literature • An exact approach for solving 3D irregular strip packing problems is proposed to address this deficit • Our approach concerns a mixed-integer linear programming model based on No-Fit Polyhedra • Established strengthening techniques from the 2D literature are adapted to 3D • An extended series of benchmarks is introduced to thoroughly benchmark this approach
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W