For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Location Problems on Undirected Flow Networks
Hiroshi TAMURA Masakazu SENGOKU Shoji SHINODA Takeo ABE
IEICE TRANSACTIONS (1976-1990)
Publication Date: 1990/12/25
Print ISSN: 0000-0000
Type of Manuscript: Special Section PAPER (Special Issue on the 3rd Karuizawa Workshop on Circuits and Systems)
Category: Graphs and Petri Nets
Full Text: PDF>>
Location theory on networks is concerned with the problem of selecting the best location in a specified network for facilities. In networks, the distance is an important measure to quantify how strongly related two vertices are. Mereover, the capacity between two vertices is also an important measure. In this paper, we define the location problems called the p-center problem, the r-cover problem and the p-median problem on undirected flow networks. We propose polynomial time algorithms to solve these problems.