Name
Abstract | ||
|---|---|---|
Separate algorithms have been reported in the literature to find dual solutions to the linear programming relaxations of the simple plant location problem, and the location covering problem. We explore the connection between these two algorithms. |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1287/trsc.27.2.194 | Transportation Science |
Field | DocType | Volume |
Flow network,Mathematical optimization,Technical note,Location theory,Equivalence (measure theory),Constraint satisfaction dual problem,Linear programming,Mathematics | Journal | 27 |
Issue | ISSN | Citations |
2 | 0041-1655 | 1 |
PageRank | References | Authors |
0.45 | 3 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| N. Xu | 1 | 1 | 0.78 |
| T. J. Lowe | 2 | 104 | 19.78 |