Technical Note—Equivalence of the 0-1 Integer Programming Problem to Discrete Generalized and Pure Networks

Fred Glover and John M. Mulvey
Additional contact information
Fred Glover: University of Colorado, Boulder, Colorado
John M. Mulvey: Princeton University, Princeton, New Jersey

Operations Research, 1980, vol. 28, issue 3-part-ii, 829-836

Abstract: We show how to formulate a 0-1 integer programming problem as a “mixed integer” generalized network and as a discrete “0- U ” pure network problem. Special integer programming structures allow convenient simplifications. The usefulness of these formulations is in providing new relaxations for integer programming that can take advantage of recent advances in the development of efficient computer programs for network problems. We cite three practical applications in which these ideas have led to marked improvement in solution efficiency.

Date: 1980
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.28.3.829 (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:28:y:1980:i:3-part-ii:p:829-836

Access Statistics for this article

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