Solving binary cutting stock problems by column generation and branch-and-bound |
| |
| Authors: | Pamela H Vance Cynthia Barnhart Ellis L Johnson George L Nemhauser |
| |
| Institution: | (1) School of Industrial and Systems Engineering, Georgia Institute of Technology, 30332-0205 Atlanta, Georgia |
| |
| Abstract: | We present an algorithm for the binary cutting stock problem that employs both column generation and branch-and-bound to obtain optimal integer solutions. We formulate a branching rule that can be incorporated into the subproblem to allow column generation at any node in the branch-and-bound tree. Implementation details and computational experience are discussed.This research was supported by NSF and AFOSR grant DDM-9115768 |
| |
| Keywords: | column generation cutting stock problem branch-and-bound |
| 本文献已被 SpringerLink 等数据库收录！ |
