Robust mixed-integer linear programming models for the irregular strip packing problem

•Two new nesting MIP models are proposed, compared and assessed.•Direct geometry and no-fit-polygon convex decomposition are used.•General models as they easily support pieces with complex geometries.•Easier to implement than previous models in the literature.•Outperform the best exact approach know...

Ausführliche Beschreibung