A dual simplex algorithm for finding all shortest paths.
Michael FlorianSang NguyenStefano PallottinoPublished in: Networks (1981)
Keyphrases
- shortest path
- simplex algorithm
- primal dual
- network simplex algorithm
- minimum cost flow
- shortest path algorithm
- linear programming
- shortest path problem
- finding the shortest path
- linear program
- linear programming problems
- path length
- flow graph
- road network
- randomly generated
- approximation algorithms
- geodesic distance
- convergence rate
- travel time
- convex optimization
- interior point methods
- interior point
- spatial networks
- feasible solution
- strongly connected components
- image processing