A finite algorithm for the continuousp-center location problem on a graph |
| |
| Authors: | Arie Tamir |
| |
| Institution: | (1) Department of Statistics, Tel-Aviv University, 69978 Tel-Aviv, Israel |
| |
| Abstract: | LetG=(V,E) be an undirected graph with positive integer edge lengths. Letm be the number of edges inE, and letd be the sum of the edge lengths. We prove that the solution value to the continuousp-center location problem is a rationalp
1/p
2, where logp
1=O(m
5 logd+m
6 logp),i=1,2. This result is then used to construct a finite algorithm for the continuousp-center problem. |
| |
| Keywords: | Location Theory p-Center Problems Finite Algorithms |
| 本文献已被 SpringerLink 等数据库收录！ |
|
