Name
Abstract | ||
|---|---|---|
This paper proposes a new variant of a label correcting polynomially bounded and computationally efficient shortest path algorithm, called the partitioning shortest path (PSP) algorithm. This variant, called the Extended PSP algorithm, provides a new rule for selecting scan eligible nodes to scan which has promising computational properties, particularly when shortest path algorithms are employed in relaxation strategies. In addition, results are established for this variant which provide a percent of optimality solution procedure. |
Year | DOI | Venue |
|---|---|---|
1986 | 10.1016/0166-218X(86)90082-X | Discrete Applied Mathematics |
Keywords | Field | DocType |
new variant,partitioning shortest path algorithm,shortest path algorithm | Mathematical optimization,Combinatorics,Shortest path problem,Algorithm,Constrained Shortest Path First,Yen's algorithm,Shortest Path Faster Algorithm,Longest path problem,Widest path problem,Mathematics,Euclidean shortest path,K shortest path routing | Journal |
Volume | Issue | ISSN |
13 | 2-3 | Discrete Applied Mathematics |
Citations | PageRank | References |
0 | 0.34 | 2 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nancy V. Phillips | 1 | 0 | 0.34 |