A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
提出了一种结合强割平面与分支定界的算法来解决节点打包问题，割平面来自团和提升奇洞不等式，并报告了计算结果。
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.