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.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Nemhauser, G., Sigismondi, G. A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing. J Oper Res Soc 43, 443–457 (1992). https://doi.org/10.1057/jors.1992.71
Published:
Issue Date:
DOI: https://doi.org/10.1057/jors.1992.71