A unified limited column generation approach for facility location problems ontrees

D.X. Shaw

Annals of Operations Research, 1999, vol. 87, issue 0, 363-382

Abstract: In this paper, we show that several well‐known facility location problems on trees, including the Uncapacitated Facility Location Problem (UFLP), the Facility Constrained Covering Problem (FCCP), the Customer Constrained Covering Problem (CCCP), theRound‐Trip Covering Problem (RTCP), the p‐Center Problem, and the p‐Median Problem, can be formulated uniformly into a special structured Tree Partitioning Problem (TPP). Then, we develop a generic algorithm to solve all these facility location problems. Although our algorithm is a generic one, our time complexity for solving each of these problems matches the best time complexity of the “dedicated” algorithm. We believe our approach has shown much insight into the location problems on trees. Copyright Kluwer Academic Publishers 1999

Date: 1999
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018901523519 (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:87:y:1999:i:0:p:363-382:10.1023/a:1018901523519

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

DOI: 10.1023/A:1018901523519

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 ().