A Strongly Polynomial Reduction for Linear Programs over Grids.
Lorenz KlausPublished in: CoRR (2014)
Keyphrases
- strongly polynomial
- linear program
- linear programming
- minimum cost flow
- simplex method
- dynamic programming
- optimal solution
- column generation
- objective function
- interior point methods
- primal dual
- mixed integer
- np hard
- stochastic programming
- semi infinite
- integer program
- mixed integer linear program
- linear inequalities
- learning algorithm
- market equilibrium
- shortest path algorithm
- bi objective
- semidefinite programming
- graph cuts
- evolutionary algorithm