Advanced search
Publication Cover
Journal of the Operational Research Society Volume 43, 1992 - Issue 5: Mathematical Programming in Honour of Ailsa Land
Submit an article Journal homepage
7
Views
79
CrossRef citations to date
0
Altmetric
General Paper

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

G. L. NemhauserSchool of Industrial and Systems Engineering, Georgia Institute of Technology
&
G. SigismondiSchool of Industrial and Systems Engineering, Georgia Institute of Technology
Pages 443-457 | Published online: 20 Dec 2017
 
Sample our Economics, Finance,Business & Industry journals, sign in here to start your access, latest two full volumes FREE to you for 14 days

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.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.