Iteration Skipping in Primal Integer Programming

Larry R. Arnold and Mandell Bellmore
Additional contact information
Larry R. Arnold: Tulane University, New Orleans, Louisiana
Mandell Bellmore: Block McGibony and Associates, Silver Spring, Maryland

Operations Research, 1974, vol. 22, issue 1, 129-136

Abstract: An examination of computational results using the simplified primal integer programming algorithm of G lover reveals the existence of long sequences of iterations following a specific pattern. This paper examines the structure of these sequences so that both the termination of a sequence and the tableau at that point can be predicted. It then constructs an algorithm that exploits this structure by performing the iterations of the sequence implicitly and presents computational results.

Date: 1974
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.22.1.129 (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:22:y:1974:i:1:p:129-136

Access Statistics for this article

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