A DC programming approach for constrained two-dimensional non-guillotine cutting problem
Computational Engineering, Finance, and Science
2014-04-15 v1
Abstract
We investigate a new application of Difference of Convex functions programming and DCA in solving the constrained two-dimensional non-guillotine cutting problem. This problem consists of cutting a number of rectangular pieces from a large rectangular object. The cuts are done under some constraints and the objective is to maximize the total value of the pieces cut. We reformulate this problem as a DC program and solve it by DCA. The performance of the approach is compared with the standard solver CPLEX.
Cite
@article{arxiv.1404.3330,
title = {A DC programming approach for constrained two-dimensional non-guillotine cutting problem},
author = {Mahdi Moeini and Hoai An Le Thi},
journal= {arXiv preprint arXiv:1404.3330},
year = {2014}
}
Comments
Proceedings of the International Conference on Industrial Engineering and Systems Management (IESM 2011), Metz, May 2011, pp. 212-221, (2011)