Finite dominating sets for network location problems

Finite dominating sets for network location problems

0.00 Avg rating0 Votes
Article ID: iaor1993659
Country: United States
Volume: 39
Issue: 1
Start Page Number: 100
End Page Number: 118
Publication Date: Jan 1991
Journal: Operations Research
Authors: , ,
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. The authors attempt to unify and generalize results of this sort. They 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.

Reviews

Required fields are marked *. Your email address will not be published.