Equivalent Integer Programs and Canonical Problems

Gordon H. Bradley
Additional contact information
Gordon H. Bradley: Yale University

Management Science, 1971, vol. 17, issue 5, 354-366

Abstract: A theory of equivalent integer programs is developed that shows that every all-integer integer programming problem is equivalent to infinitely many other integer programming problems. The equivalence is such that the solution to any one problem in the equivalence class determines the solution to every other problem in the class. Procedures to construct certain canonical problems in each equivalence class are described. The relationship of this theory to computational algorithms is discussed.

Date: 1971
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.17.5.354 (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:ormnsc:v:17:y:1971:i:5:p:354-366

Access Statistics for this article

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