期刊
出版社
E D P SCIENCES
DOI: 10.1051/itmconf/20171400005
关键词
-
资金
- Sao Paulo Research Foundation (FAPESP) [2015/24987-4, 2014/23900-0, 2013/07375-0, 2012/18653-8, 2010/10133-0]
- Brazilian Federal Agency for Support and Evaluation of Graduate Education (CAPES)
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 constraints are proposed to improve the model. Computational experiments were performed for instances with convex pieces. The results show the proposed formulation is better than the previous one for most instances, since it improves lower bounds and reduces run-time and number of nodes explored to prove optimality.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据