One and Two Facility Network Design Revisited

Trilochan Sastry ()

Annals of Operations Research, 2001, vol. 108, issue 1, 19-31

Abstract: The one facility one commodity network design problem (OFOC) with nonnegative flow costs considers the problem of sending d units of flow from a source to a destination where arc capacity is purchased in batches of C units. The two facility problem (TFOC) is similar, but capacity can be purchased either in batches of C units or one unit. Flow costs are zero. These problems are known to be NP-hard. We describe an exact O(n 3 3 n ) algorithm for these problems based on the repeated use of a bipartite matching algorithm. We also present a better lower bound of Ω(n 2 k * ) for an earlier Ω(n 2k ) algorithm described in the literature where k=⌊d/C⌋ and k * =min k,⌊(n−2)/2⌋. The matching algorithm is faster than this one for k≥⌊(n−2)/2⌋. Finally, we provide another reformulation of the problem that is quasi integral. This property could be useful in designing a modified version of the simplex method to solve the problem using a sequence of pivots with integer extreme solutions, referred to as the integral simplex method in the literature. Copyright Kluwer Academic Publishers 2001

Keywords: network design; exact algorithm; integer solutions; quasi-integral (search for similar items in EconPapers)
Date: 2001
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1016042524674 (text/html)
Access to full text is restricted to subscribers.

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:spr:annopr:v:108:y:2001:i:1:p:19-31:10.1023/a:1016042524674

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1016042524674

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().