| Article ID: | iaor19992612 |
| Country: | Netherlands |
| Volume: | 81 |
| Issue: | 2 |
| Start Page Number: | 257 |
| End Page Number: | 262 |
| Publication Date: | Apr 1998 |
| Journal: | Mathematical Programming |
| Authors: | Boyd E. Andrew, Yan Xiao-Qing |
| Keywords: | knapsack problem |
An algorithm for generating cutting planes for mixed-integer knapsack polyhedra is described. The algorithm represents an exact separation procedure and is based on a general methodology proposed by one of the authors in an earlier paper. Computational results are presented.