A DC programming approach for constrained two-dimensional non-guillotine cutting problem
Preprint
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.Keywords
All Related Versions
This publication has 4 references indexed in Scilit:
- Multicategory ψ-Learning and Support Vector Machine: Computational ToolsJournal of Computational and Graphical Statistics, 2005
- A population heuristic for constrained two-dimensional non-guillotine cuttingEuropean Journal of Operational Research, 2004
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search ProcedureOperations Research, 1985
- Two Algorithms for Constrained Two-Dimensional Cutting Stock ProblemsOperations Research, 1983