Name
Abstract | ||
|---|---|---|
Facility Location Problems have always been studied with the assumption that the environment in the network is static and does not change over time. In practice, however, the environment is usually dynamic and we must consider the facility location in a global view. In this paper, we impose the following additional constraints on input facilities: the total number of facilities to be placed is not known in advance and a facility cannot be removed once it is placed. We solve this problem by presenting an algorithm to find a facility permutation such that any prefix of the permutation of facilities is near-optimal over any other facility subset. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11496199_17 | AAIM |
Keywords | Field | DocType |
facility location problems,input facility,facility location,total number,facility permutation,following additional constraint,global view,facility subset,facility location problem | Approximation algorithm,Mathematical optimization,Algorithmics,Computer science,Permutation,Facility location problem,Prefix,1-center problem | Conference |
Volume | ISSN | ISBN |
3521 | 0302-9743 | 3-540-26224-5 |
Citations | PageRank | References |
0 | 0.34 | 15 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wenqiang Dai | 1 | 29 | 5.84 |
| Peng Xiao | 2 | 0 | 0.34 |
| Ke Jiang | 3 | 0 | 0.34 |