Name
Abstract | ||
|---|---|---|
Abstract This paper determines the optimal location of K connections in the plane, where a connection links pairs of existing facilities. Both uncapacitated and capacitated versions of the problem are considered. Discretization results for general polyhedral gauges and other properties are established. Two heuristic algorithms are developed for each case using the concept of a shortest path flow set coupled with a sequential location and allocation approach. Computational results show that the algorithms are efficient and accurate. Keywords: planar location; connection; capacity. 2 |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/s10479-005-2045-1 | Annals of Operations Research |
Keywords | DocType | Volume |
connection,planar location,capacity,heuristic algorithm,shortest path | Journal | 136 |
Issue | ISSN | Citations |
1 | 15729338 | 5 |
PageRank | References | Authors |
1.00 | 7 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Simin Huang | 1 | 38 | 5.76 |
| Rajan Batta | 2 | 849 | 89.39 |
| Kathrin Klamroth | 3 | 579 | 41.93 |
| Rakesh Nagi | 4 | 443 | 45.82 |