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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of global optimization Ročník 72; číslo 1; s. 89 - 107
Hlavní autori:	Cherri, Luiz H., Cherri, Adriana C., Soler, Edilaine M.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.09.2018 Springer Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!