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 β¦
Facility location on a grid with a diagonal line
β Scribed by Enrique R. Venta; Francis J. Nourie
- Publisher
- John Wiley and Sons
- Year
- 1989
- Tongue
- English
- Weight
- 420 KB
- Volume
- 36
- Category
- Article
- ISSN
- 0894-069X
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
Minimax and maximin facility location pr
β
Zvi Drezner; George O. Wesolowsky
π
Article
π
1983
π
John Wiley and Sons
π
English
β 401 KB
π 1 views
A note on equity across groups in facili
β
Tammy Drezner; Zvi Drezner
π
Article
π
2011
π
John Wiley and Sons
π
English
β 89 KB
π 1 views
On a tree-shaped facility location probl
β
Ramon Rabinovitch; Arie Tamir
π
Article
π
1992
π
John Wiley and Sons
π
English
β 277 KB
π 1 views
Location of an obnoxious facility on a n
β
Martine LabbΓ©
π
Article
π
1990
π
John Wiley and Sons
π
English
β 494 KB
π 1 views
Minimum covering criterion for obnoxious
β
Berman, Oded; Drezner, Zvi; Wesolowsky, George O.
π
Article
π
1996
π
John Wiley and Sons
π
English
β 381 KB
π 1 views
The objective of this article was to find a location of a new facility on a network so that the total number (weight) of nodes within a prespecified distance R is minimized. This problem is applicable when locating an obnoxious facility such as garbage dumps, nuclear reactors, prisons, and military