A fully polynomial epsilon approximation cutting plane algorithm for solving combinatorial linear programs containing a sufficiently large ball.
E. Andrew BoydPublished in: Oper. Res. Lett. (1997)
Keyphrases
- linear program
- cutting plane algorithm
- integer program
- cutting plane
- column generation
- linear programming
- simplex method
- lagrangian dual
- linear programming problems
- dual variables
- valid inequalities
- integer programming
- mixed integer
- quadratic program
- maximum margin
- interior point methods
- lp relaxation
- primal dual
- optimal solution
- convex functions
- lagrangian relaxation
- np hard
- objective function
- quadratic programming
- approximation algorithms
- vehicle routing problem with time windows
- dynamic programming
- convex programming
- max flow
- lower bound
- genetic algorithm
- branch and bound
- worst case
- interior point