This paper considers the problem of locating a central facility on a tree network. The central facility takes the form of a subtree of the network and provides service to several demand points located at the nodes of the network. Two types of costs are involved in evaluating a given facility selecti
β¦ LIBER β¦
On a tree-shaped facility location problem of Minieka
β Scribed by Ramon Rabinovitch; Arie Tamir
- Publisher
- John Wiley and Sons
- Year
- 1992
- Tongue
- English
- Weight
- 277 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
On the location of a tree-shaped facilit
β
Kim, Tae Ung; Lowe, Timothy J.; Tamir, Arie; Ward, James E.
π
Article
π
1996
π
John Wiley and Sons
π
English
β 769 KB
Robust location problems with pos/neg we
β
Rainer E. Burkard; Helidon Dollani
π
Article
π
2001
π
John Wiley and Sons
π
English
β 155 KB
π 1 views
Minimax and maximin facility location pr
β
Zvi Drezner; George O. Wesolowsky
π
Article
π
1983
π
John Wiley and Sons
π
English
β 401 KB
π 1 views
Location of an obnoxious facility on a n
β
Martine LabbΓ©
π
Article
π
1990
π
John Wiley and Sons
π
English
β 494 KB
π 1 views
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
Worst-case incremental analysis for a cl
β
R. L. Francis; T. J. Lowe; A. Tamir
π
Article
π
2002
π
John Wiley and Sons
π
English
β 112 KB
π 1 views