A polynomial-time simplex method for the maximum k-flow problem.
Donald K. WagnerHong WanPublished in: Math. Program. (1993)
Keyphrases
- simplex method
- linear programming
- linear program
- linear fractional
- min cost
- convergence rate
- simplex algorithm
- special case
- primal dual
- column generation
- linear programming problems
- interior point algorithm
- interior point methods
- worst case
- approximation algorithms
- markov chain
- semidefinite programming
- dynamic programming
- np hard
- computational complexity