MIP models for the irregular strip packing problem: new symmetry breaking constraints
The irregular strip packing problem consists in minimizing the length used to cut a set of pieces from a board with fixed width. Recently, a mixed integer programming model was proposed for the problem, but it may allow a large number of symmetric solutions. In this paper, new symmetry breaking cons...
Main Authors: | Rodrigues Marcos Okamura, Cherri Luiz Henrique, Mundim Leandro Resende |
---|---|
Format: | Article |
Language: | English |
Published: |
EDP Sciences
2017-01-01
|
Series: | ITM Web of Conferences |
Online Access: | https://doi.org/10.1051/itmconf/20171400005 |
Similar Items
-
A MODEL-BASED HEURISTIC FOR THE IRREGULAR STRIP PACKING PROBLEM
by: Luiz Henrique Cherri, et al. -
SOLVING IRREGULAR STRIP PACKING PROBLEMS WITH FREE ROTATIONS USING SEPARATION LINES
by: Jeinny Peralta, et al. -
Using constraints to break value symmetries in constraint satisfaction problems.
Published: (2005) -
2D irregular strip packing at Kohler signs
by: Bossenger, Wayne
Published: (2015) -
A Hybrid Algorithm for Strip Packing Problem with Rotation Constraint
by: Chen Huan, et al.
Published: (2016-01-01)