| Article ID: | iaor20063628 |
| Country: | South Korea |
| Volume: | 30 |
| Issue: | 4 |
| Start Page Number: | 61 |
| End Page Number: | 70 |
| Publication Date: | Dec 2005 |
| Journal: | Journal of the Korean ORMS Society |
| Authors: | Kang Maing-Kyu, Yoon Ki-Seop, Bang Sung-Kyu |
| Keywords: | cutting stock, programming: branch and bound |
In this paper, we develop an improved branch and bound algorithm for the (un)weighted unconstrained two-dimensional cutting problem. In the proposed algorithm, we improve the branching strategies of the existing exact algorithm and reduce the size of problem by removing the dominated pieces from the problem. We apply the newly proposed definition of dominated cutting pattern and it can reduce the number of nodes that must be searched during the algorithm procedure. The efficiency of the proposed algorithm is presented through comparison with the exact algorithm known as the most efficient.