A New Foundation for a Simplified Primal Integer Programming Algorithm

Fred Glover
Additional contact information
Fred Glover: University of Texas, Austin, Texas

Operations Research, 1968, vol. 16, issue 4, 727-740

Abstract: Following the approach underlying the Pseudo Primal-Dual Integer Programming Algorithm, a new foundation for a simplified primal integer programming algorithm is given. In addition, new choice rules are prescribed which guarantee finite convergence, and a criterion of optimality is introduced that permits the algorithm to terminate before dual feasibility is achieved.

Date: 1968
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.16.4.727 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:16:y:1968:i:4:p:727-740

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().