A polynomial time primal network simplex algorithm for minimum cost flows.
James B. OrlinPublished in: Math. Program. (1997)
Keyphrases
- network simplex algorithm
- minimum cost
- approximation algorithms
- simplex algorithm
- primal dual
- polynomially solvable
- np hard
- network flow problem
- minimum cost flow
- special case
- linear program
- worst case
- spanning tree
- linear programming
- network flow
- linear programming problems
- network design problem
- interior point methods
- optimal solution
- computational complexity
- lower bound