Journal article
Worst-case incremental analysis for a class of p-facility location problems
Networks, Vol.39(3), pp.139-143
05/2002
DOI: 10.1002/net.10021
Abstract
We consider a rather large class of p-facility location models including the p-median, p-center, and other related and more general models. For any such model of interest with p new facilities, let v(p) denote the minimal objective function value and let n be the number of demand points. Given 1 ≤ p < q ≤ n, we find easily computed positive constants k(p, q), where v(q)/v(p) ≤ k(p, q) ≤ 1. These resulting inequalities relating v(p) and v(q) are worst case, since they are attained as equalities for a class of “hub-and-spoke” trees. Our results also provide insight into some demand point aggregation problems, where a graph of the function v(q) can provide an upper bound on aggregation error.
Details
- Title: Subtitle
- Worst-case incremental analysis for a class of p-facility location problems
- Creators
- R. L. Francis - University of FloridaT. J. Lowe - University of IowaA. Tamir - Tel Aviv University
- Resource Type
- Journal article
- Publication Details
- Networks, Vol.39(3), pp.139-143
- DOI
- 10.1002/net.10021
- ISSN
- 0028-3045
- eISSN
- 1097-0037
- Publisher
- Wiley Subscription Services, Inc., A Wiley Company
- Number of pages
- 5
- Language
- English
- Date published
- 05/2002
- Academic Unit
- Business Analytics
- Record Identifier
- 9984963110002771
Metrics
1 Record Views