## Abstract We consider a metric uncapacitated facility location problem where we must assign each customer to a facility and meet the demand of the customer in future time periods through production and inventory decisions at the facility. We show that the problem, in general, is as hard to approx
โฆ LIBER โฆ
Multiobjective analysis of facility location decisions
โ Scribed by John Current; Hokey Min; David Schilling
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 866 KB
- Volume
- 49
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Integrating facility location and produc
โ
H. Edwin Romeijn; Thomas C. Sharkey; Zuo-Jun Max Shen; Jiawei Zhang
๐
Article
๐
2009
๐
John Wiley and Sons
๐
English
โ 157 KB
Multiobjective decisions analysis for en
โ
Basile A. Dendrou; Stergios A. Dendrou; Elias N. Houstis
๐
Article
๐
1980
๐
Elsevier Science
๐
English
โ 894 KB
Multiobjective decision analysis with en
โ
William K. Smith
๐
Article
๐
1983
๐
Elsevier Science
๐
English
โ 221 KB
Parametric analysis of optimal facility
โ
Margaret L. Brandeau; Samuel S. Chiu
๐
Article
๐
1991
๐
John Wiley and Sons
๐
English
โ 772 KB
Sensitivity analysis of the optimal loca
โ
Zvi Drezner
๐
Article
๐
1985
๐
John Wiley and Sons
๐
English
โ 721 KB
Analysis of a Local Search Heuristic for
โ
Madhukar R. Korupolu; C.Greg Plaxton; Rajmohan Rajaraman
๐
Article
๐
2000
๐
Elsevier Science
๐
English
โ 258 KB
In this paper, we study approximation algorithms for several NP-hard facility location problems.We prove that a simple local search heuristic yields polynomialtime constant-factor approximation bounds for the metric versions of the uncapacitated k-median problem and the uncapacitated facility locati