@article{oai:niigata-u.repo.nii.ac.jp:00001757, author = {Tamura, Hiroshi and Sengoku, Masakazu and Shinoda, Shoji and Abe, Takeo}, issue = {12}, journal = {IEICE Transactions, IEICE Transactions}, month = {Dec}, note = {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.}, pages = {1989--1993}, title = {Location Problems on Undirected Flow Networks}, volume = {E73-E}, year = {1990} }