| Article ID: | iaor19931539 |
| Country: | United Kingdom |
| Volume: | 43 |
| Issue: | 5 |
| Start Page Number: | 443 |
| End Page Number: | 457 |
| Publication Date: | May 1992 |
| Journal: | Journal of the Operational Research Society |
| Authors: | Nemhauser G.L., Sigismondi G. |
| Keywords: | heuristics, networks |
The authors present a strong cutting plane/branch-and-bound algorithm for node packing. The cutting planes are obtained from cliques and lifting odd hold inequalities. Computational results are reported.