An O(nm)-Time Network Simplex Algorithm for the Shortest Path Problem.
Donald GoldfarbZhiying JinPublished in: Oper. Res. (1999)
Keyphrases
- shortest path problem
- network simplex algorithm
- minimum cost flow
- shortest path
- bi objective
- simplex algorithm
- single source
- shortest path algorithm
- interval data
- minimum cost
- network flow problem
- multiple objectives
- combinatorial optimization problems
- minimum cut
- directed graph
- directed acyclic graph
- linear programming
- minimal cost
- objective function
- routing problem
- probabilistic model
- neural network