On strongly polynomial variants of the network simplex algorithm for the maximum flow problem.
Donald GoldfarbJianxiu HaoPublished in: Oper. Res. Lett. (1991)
Keyphrases
- network simplex algorithm
- minimum cost flow
- strongly polynomial
- simplex algorithm
- linear programming
- bi objective
- minimum cost
- shortest path
- shortest path algorithm
- linear program
- minimum cut
- maximum flow
- primal dual
- minimal cost
- feasible solution
- simplex method
- optimal solution
- linear programming problems
- graph cuts
- np hard
- multi objective