Name
Title | ||
|---|---|---|
Improved algorithms for joint optimization of facility locations and network connections. |
Abstract | ||
|---|---|---|
•We study how to jointly optimize facility locations and their connections to clients.•We develop an improved approximation algorithm based on a minimum spanning tree.•When each vertex has a client, the problem is equivalent to matroid minimization.•When all vertices are on a tree, the problem can be solved by dynamic programming. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.ejor.2015.10.003 | European Journal of Operational Research |
Keywords | Field | DocType |
Approximation algorithm,Polynomial time algorithm,Facility location,Network connection,Steiner forest | Approximation algorithm,Mathematical optimization,Steiner tree problem,Algorithm,Facility location problem,Lagrangian relaxation,Time complexity,1-center problem,Mathematics,Minimum spanning tree,Steiner forest | Journal |
Volume | Issue | ISSN |
250 | 3 | 0377-2217 |
Citations | PageRank | References |
0 | 0.34 | 26 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiaofan Lai | 1 | 76 | 4.82 |
| Zhou Xu | 2 | 208 | 14.97 |