A Graph-Theoretic Equivalence for Integer Programs

Jean-Claude Picard and H. Donald Ratliff
Additional contact information
Jean-Claude Picard: École Polytechnique, Montreal, Quebec, Canada
H. Donald Ratliff: University of Florida, Gainesville, Florida

Operations Research, 1973, vol. 21, issue 1, 261-269

Abstract: This paper is concerned with the relation between 0-1 integer programs and graphs. An equivalence is established between solving 0-1 integer programs with quadratic or linear objective functions and solving a cut problem on a related graph.

Date: 1973
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.21.1.261 (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:21:y:1973:i:1:p:261-269

Access Statistics for this article

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