2022
DOI: 10.48550/arxiv.2206.00032
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

A new mixed-integer programming model for irregular strip packing based on vertical slices with a reproducible survey

Abstract: The irregular strip-packing problem, also known as nesting or marker making, is defined as the automatic computation of a non-overlapping placement of a set of non-convex polygons onto a rectangular strip of fixed width and unbounded length, such that the strip length is minimized. Nesting methods based on heuristics are a mature technology, and currently, the only practical solution to this problem. However, recent performance gains of the Mixed-Integer Programming (MIP) solvers, together with the known limit… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 62 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?