Finite Dominating Sets for Network Location Problems

J. N. Hooker, R. S. Garfinkel and C. K. Chen
Additional contact information
J. N. Hooker: Carnegie Mellon University, Pittsburgh, Pennsylvania
R. S. Garfinkel: University of Connecticut, Storrs, Connecticut
C. K. Chen: Petro Canada, Donmills, Ontario, Canada

Operations Research, 1991, vol. 39, issue 1, 100-118

Abstract: A research theme involving location on networks, since its inception, has been the identification of a finite dominating set (FDS), or a finite set of points to which an optimal solution must belong. We attempt to unify and generalize results of this sort. We survey the literature and then prove some theorems that subsume most previous results and that are, at the same time, more general than previous results. The paper is aimed primarily at investigators who wish to know whether an FDS exists for a specific problem.

Keywords: networks/graphs:; location; on; networks (search for similar items in EconPapers)
Date: 1991
References: Add references at CitEc
Citations: View citations in EconPapers (22)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.39.1.100 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:39:y:1991:i:1:p:100-118

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().