|
|||||
|
|
A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing |
|
| Authors: | G. L. Nemhauser G. Sigismondi |
| Affiliation: | 1.School of Industrial and Systems Engineering, Georgia Institute of Technology, |
| Abstract: | We present a strong cutting plane/branch-and-bound algorithm for node packing. The cutting planes are obtained from cliques and lifting odd hole inequalities. Computational results are reported. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |