Technical Note—Enforcing Constraints on Expanded Networks

Eric V. Denardo and Bennett L. Fox
Additional contact information
Eric V. Denardo: Yale University, New Haven, Connecticut
Bennett L. Fox: Université de Montréal, Montréal, Canada

Operations Research, 1980, vol. 28, issue 5, 1213-1218

Abstract: Any pure integer program can be cast as a shortest-route problem in an expanded network, subject to a set of side constraints. Here we select side constraints and alter the network to enforce them or surrogates for them. Logical constraints prove especially amenable to this treatment; we handle generalized upper bounds, variable upper bounds, and others simply by reconnecting arcs. Enforcing such constraints increases the fidelity of the expanded network to the integer program and tightens the relaxations that occur when the integer program is solved by implicit enumeration of the expanded network's paths.

Date: 1980
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.28.5.1213 (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:5:p:1213-1218

Access Statistics for this article

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