Name
Abstract | ||
|---|---|---|
A generic multifacility location problem is considered which subsumes, as special cases, several NP-hard location problems that have appeared in literature. A unified algorithm is presented which solves the generic problem in polynomial time when problem structure, as defined by interactions between pairs of facilities, satisfies certain properties. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1287/trsc.28.2.104 | Transportation Science |
Field | DocType | Volume |
Dynamic programming,Mathematical optimization,Polynomial,Location theory,Time complexity,Mathematics | Journal | 28 |
Issue | ISSN | Citations |
2 | 0041-1655 | 6 |
PageRank | References | Authors |
0.67 | 14 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dilip Chhajed | 1 | 339 | 27.21 |
| T. J. Lowe | 2 | 104 | 19.78 |