Abstract
In this paper, we introduce a new type of single-facility location problem on networks which includes as special cases most of the classical criteria in the literature. Structural results as well as a finite dominating set for the optimal locations are developed. Also, the extension to the multifacility case is discussed. The frontiers for finding easy finite dominating sets are shown by a counterexample. © 1999 John Wiley & Sons, Inc. Networks 34: 283–290, 1999
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
