A competitive (dual) simplex method for the assignment problem.
Michel L. BalinskiPublished in: Math. Program. (1986)
Keyphrases
- simplex method
- primal dual
- linear programming
- linear program
- linear fractional
- convergence rate
- np hard
- interior point methods
- linear programming problems
- convex optimization
- column generation
- approximation algorithms
- simplex algorithm
- interior point algorithm
- semidefinite programming
- learning algorithm
- special case
- objective function