Comparison of Some Algorithms for Solving the Group Theoretic Integer Programming Problem

Chen Der-San and Stanley Zionts
Additional contact information
Chen Der-San: University of Alabama, Tuscaloosa, Alabama
Stanley Zionts: State University of New York, Buffalo, New York

Operations Research, 1976, vol. 24, issue 6, 1120-1128

Abstract: Gomory has shown that the group-theoretic problem associated with an integer programming problem can be treated as a shortest-route problem. Thus one may solve it by a standard shortest-route algorithm. However, because of the special properties of the constructed problem, one can simplify and modify the algorithm. This paper presents five such simplified algorithms and compares their computational results with the group-theoretic algorithms developed by Gomory, Hu, and Shapiro.

Date: 1976
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.24.6.1120 (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:24:y:1976:i:6:p:1120-1128

Access Statistics for this article

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