IEICE TRANSACTIONS on Fundamentals
Some Covering Problems in Location Theory on Flow Networks
Summary :
Location theory on networks is concerned with the problem of selecting the best location in a specified network for facilities. Many studies for the theory have been done. However, few studies treat location problems on networks from the standpoint of measuring the closeness between two vertices by the capacity (maximum flow value) between two vertices. This paper concerns location problems, called covering problems on flow networks. We define two types of covering problems on flow networks. We show that covering problems on undirected flow networks and a covering problem on directed flow networks are solved in polynomial times.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E75-A No.6 pp.678-684
- Publication Date
- 1992/06/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section of Papers Selected from 1991 Joint Technical Conference on Circuits/Systems, Computers and Communications (JTC-CSCC '91))
- Category
- Combinational/Numerical/Graphic Algorithms
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, "Some Covering Problems in Location Theory on Flow Networks" in IEICE TRANSACTIONS on Fundamentals,
vol. E75-A, no. 6, pp. 678-684, June 1992, doi: .
Abstract: Location theory on networks is concerned with the problem of selecting the best location in a specified network for facilities. Many studies for the theory have been done. However, few studies treat location problems on networks from the standpoint of measuring the closeness between two vertices by the capacity (maximum flow value) between two vertices. This paper concerns location problems, called covering problems on flow networks. We define two types of covering problems on flow networks. We show that covering problems on undirected flow networks and a covering problem on directed flow networks are solved in polynomial times.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e75-a_6_678/_p
Copy
@ARTICLE{e75-a_6_678,
author={Hiroshi TAMURA, Masakazu SENGOKU, Shoji SHINODA, Takeo ABE, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Some Covering Problems in Location Theory on Flow Networks},
year={1992},
volume={E75-A},
number={6},
pages={678-684},
abstract={Location theory on networks is concerned with the problem of selecting the best location in a specified network for facilities. Many studies for the theory have been done. However, few studies treat location problems on networks from the standpoint of measuring the closeness between two vertices by the capacity (maximum flow value) between two vertices. This paper concerns location problems, called covering problems on flow networks. We define two types of covering problems on flow networks. We show that covering problems on undirected flow networks and a covering problem on directed flow networks are solved in polynomial times.},
keywords={},
doi={},
ISSN={},
month={June},}
Copy
TY - JOUR
TI - Some Covering Problems in Location Theory on Flow Networks
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 678
EP - 684
AU - Hiroshi TAMURA
AU - Masakazu SENGOKU
AU - Shoji SHINODA
AU - Takeo ABE
PY - 1992
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E75-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 1992
AB - Location theory on networks is concerned with the problem of selecting the best location in a specified network for facilities. Many studies for the theory have been done. However, few studies treat location problems on networks from the standpoint of measuring the closeness between two vertices by the capacity (maximum flow value) between two vertices. This paper concerns location problems, called covering problems on flow networks. We define two types of covering problems on flow networks. We show that covering problems on undirected flow networks and a covering problem on directed flow networks are solved in polynomial times.
ER -
English
