A Capacity Improvement Lower Bound for Fixed Charge Network Design Problems

Bruce W. Lamar, Yosef Sheffi and Warren B. Powell
Additional contact information
Bruce W. Lamar: University of California, Irvine, California
Yosef Sheffi: Massachusetts Institute of Technology, Cambridge, Massachusetts
Warren B. Powell: Princeton University, Princeton, New Jersey

Operations Research, 1990, vol. 38, issue 4, 704-710

Abstract: Network design problems concern flows over networks in which a fixed charge must be incurred before an arc becomes available for use. The uncapacitated, multicommodity network design problem is modeled with aggregate and disaggregate forcing constraints. (Forcing constraints ensure logical relationships between the fixed charge-related and the flow-related decision variables.) A new lower bound for this problem—referred to as the capacity improvement (CI) bound—is presented; and an efficient implementation scheme using shortest path and linearized knapsack programs is described. A key feature of the CI lower bound is that it is based on the LP relaxation of the aggregate version of the problem. A numerical example illustrates that the CI lower bound can converge to the optimal objective function value of the IP formulation.

Keywords: networks/graphs: network design problems; programming; integer; theory: lower bound for fixed charged problems (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations: View citations in EconPapers (10)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.38.4.704 (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:38:y:1990:i:4:p:704-710

Access Statistics for this article

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