Location Problems on Undirected Flow Networks
Summary :
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.
- Publication
- IEICE TRANSACTIONS on transactions Vol.E73-E No.12 pp.1989-1993
- Publication Date
- 1990/12/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Issue on the 3rd Karuizawa Workshop on Circuits and Systems)
- Category
- Graphs and Petri Nets
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Hiroshi TAMURA, Masakazu SENGOKU, Shoji SHINODA, Takeo ABE, "Location Problems on Undirected Flow Networks" in IEICE TRANSACTIONS on transactions,
vol. E73-E, no. 12, pp. 1989-1993, December 1990, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e73-e_12_1989/_p
Copy
@ARTICLE{e73-e_12_1989,
author={Hiroshi TAMURA, Masakazu SENGOKU, Shoji SHINODA, Takeo ABE, },
journal={IEICE TRANSACTIONS on transactions},
title={Location Problems on Undirected Flow Networks},
year={1990},
volume={E73-E},
number={12},
pages={1989-1993},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={December},}
Copy
TY - JOUR
TI - Location Problems on Undirected Flow Networks
T2 - IEICE TRANSACTIONS on transactions
SP - 1989
EP - 1993
AU - Hiroshi TAMURA
AU - Masakazu SENGOKU
AU - Shoji SHINODA
AU - Takeo ABE
PY - 1990
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E73-E
IS - 12
JA - IEICE TRANSACTIONS on transactions
Y1 - December 1990
AB - 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.
ER -
English
