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

Full description

Saved in:

Bibliographic Details
Published in:	Journal of global optimization Vol. 72; no. 1; pp. 89 - 107
Main Authors:	Cherri, Luiz H., Cherri, Adriana C., Soler, Edilaine M.
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.09.2018 Springer Springer Nature B.V
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!