A Note on Linear Programming and Integer Feasibility

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

Operations Research, 1968, vol. 16, issue 6, 1212-1216

Abstract: This paper proves a theorem that provides new strategies for solving integer programming problems, based on finding certain types of basic solutions to linear programs. The theorem is motivated by and extends ideas of Cabot and Hurter. An integer programming method based on the theorem is outlined.

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

Downloads: (external link)
http://dx.doi.org/10.1287/opre.16.6.1212 (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:6:p:1212-1216

Access Statistics for this article

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