| Author: | Hooker, J. N. Garfinkel, R. S. Chen, C. K. |
| Title: | Finite dominating sets for network location problems. |
| Journal: | Operations Research
1991 : JAN-FEB, VOL. 39:1, p. 100-118 |
| Index terms: | NETWORKS LOCATION PROBLEM |
| Language: | eng |
| Abstract: | Network location problems deal with a general model in which there are a number of points on a network, /roads, rivers, communication links etc./, that demand service from facilities that are to be located on the network. A subject involving location on network is the identification of a finite dominating set /FDS/, or a finite set of points to which some optimal solution must belong. The unification and generalization of these results is attempted in the article, that is aimed primarily at investigators who wish to know whether an FDS exists for a network location problem. A handful of theorems are proved from which most previous FDS results follow immediately and that are substantially more general than previous results. |
SCIMA