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

The irregular strip packing problem consists of cutting a set of convex and non-convex two-dimensional polygonal pieces from a board with a fixed height and infinite length. Owing to the importance of this problem, a large number of mathematical models and solution methods have been proposed. Howeve...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of global optimization Jg. 72; H. 1; S. 89 - 107
Hauptverfasser:	Cherri, Luiz H., Cherri, Adriana C., Soler, Edilaine M.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.09.2018 Springer Springer Nature B.V
Schlagworte:	Broken symmetry Computation Computer Science Constraint modelling Heuristic methods Mathematics Mathematics and Statistics Mixed integer Operations Research/Decision Theory Optimization Packing problem Production scheduling Real Functions Strip Symmetry Test procedures Nesting problems Mixed integer non-linear programming Continuous rotations Irregular pieces
ISSN:	0925-5001, 1573-2916
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!