1
Views
3
CrossRef citations to date
0
Altmetric
Theoretical Paper

A Simple Algorithm for Integer Programs Using Group Constraints

Pages 453-458 | Published online: 19 Dec 2017
 

Abstract

This paper gives an algorithm for the solution of linear integer programs which is identical in spirit to Gomory's classic cutting plane procedure but uses the abelian group formulation, also pioneered by Gomory, instead. The underlying simplicity of recent algorithmic advances and their parallel with the cutting plane method are demonstrated.

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:

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:

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.