A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing

descriptionPublicationkeyboard_double_arrow_right Article 01 May 1992 English Publisher:Informa UK LimitedJournal:Journal of the Operational Research Society, volume 43, pages 443-457 (issn: 0160-5682, eissn: 1476-9360,

Copyright policy )

Authors: Nemhauser, G. L.; Sigismondi, G.;

doi: 10.1057/jors.1992.71 , 10.2307/2583564 , 10.1057/palgrave.jors.0430507

A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing

- Summary
- Subjects
- Metrics

Abstract

Summary: 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.

Related Organizations

Georgia Institute of Technology
United States

Keywords

Computational methods for problems pertaining to operations research and mathematical programming, node packing, Integer programming, cutting plane/branch-and-bound algorithm, heuristics, Programming involving graphs or networks

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	93
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%