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. (C) 1999 John Wiley & Sons, Inc. |
Year | DOI | Venue |
---|---|---|
1999 | 10.1002/(SICI)1097-0037(199912)34:4<283::AID-NET8>3.3.CO;2-U | NETWORKS |
Keywords | Field | DocType |
location theory,network problems | Telecommunications network,Location theory,Facility location problem,Artificial intelligence,Counterexample,Unified field theory,Mathematics | Journal |
Volume | Issue | ISSN |
34 | 4 | 0028-3045 |
Citations | PageRank | References |
29 | 1.80 | 2 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Stefan Nickel | 1 | 427 | 41.70 |
Justo Puerto | 2 | 717 | 73.21 |