Efficient algorithm for the constrained two-dimensional cutting stock problem

Efficient algorithm for the constrained two-dimensional cutting stock problem

0.00 Avg rating0 Votes
Article ID: iaor20021751
Country: United Kingdom
Volume: 8
Issue: 1
Start Page Number: 3
End Page Number: 13
Publication Date: Jan 2001
Journal: International Transactions in Operational Research
Authors: ,
Keywords: combinatorial analysis
Abstract:

This paper considers the constrained two-dimensional cutting stock problem. Some properties of the problem are derived leading to the development of a new algorithm, which uses a very efficient branching strategy for the solution of this problem. This strategy enables the early rejection of partial solutions that cannot lead to optimality. Computational results are given and compared with those produced by a leading alternative method. These results show that the new algorithm is far superior in terms of the computer time needed to solve such problems.

Reviews

Required fields are marked *. Your email address will not be published.