Polynomial-Time Primal Simplex Algorithms for the Minimum Cost Network Flow Problem.
Donald GoldfarbJianxiu HaoPublished in: Algorithmica (1992)
Keyphrases
- minimum cost
- simplex algorithm
- network simplex algorithm
- network flow problem
- approximation algorithms
- minimum cost flow
- np hard
- worst case
- linear programming
- network flow
- primal dual
- polynomially solvable
- computational complexity
- spanning tree
- minimal cost
- network design problem
- linear program
- special case
- convergence rate
- simplex method
- linear programming problems