A strongly polynomial simplex method for the linear fractional assignment problem.
Santosh N. KabadiAbraham P. PunnenPublished in: Oper. Res. Lett. (2008)
Keyphrases
- strongly polynomial
- linear fractional
- simplex method
- linear programming
- linear program
- np hard
- column generation
- optimal solution
- primal dual
- feasible solution
- dynamic programming
- integer programming
- interior point methods
- quadratic programming
- objective function
- semidefinite programming
- minimum cost flow
- minimum cost
- lower bound