On the Complexity of a Cutting Plane Algorithm for Solving Combinatorial Linear Programs.
E. Andrew BoydPublished in: SIAM J. Discret. Math. (1996)
Keyphrases
- linear program
- cutting plane algorithm
- integer program
- cutting plane
- column generation
- linear programming
- simplex method
- linear programming problems
- lagrangian dual
- dual variables
- valid inequalities
- integer programming
- mixed integer
- quadratic program
- lp relaxation
- primal dual
- maximum margin
- interior point methods
- np hard
- optimal solution
- max flow
- objective function
- dynamic programming
- mixed integer programming
- lagrangian relaxation
- quadratic programming
- convex programming
- special case
- computational complexity
- linear svm
- routing problem
- feasible solution
- interior point
- machine learning