Chvátal Cuts and ODD Cycle Inequalities in Quadratic 0 - 1 Optimization.
Endre BorosYves CramaPeter L. HammerPublished in: SIAM J. Discret. Math. (1992)
Keyphrases
- quadratic optimization
- strictly convex
- valid inequalities
- facet defining
- interior point methods
- primal dual
- linear programming
- integer programming
- sufficient conditions
- traveling salesman problem
- mixed integer programming
- cutting plane
- newton method
- convex hull
- support vector machine
- mixed integer
- lower and upper bounds
- column generation
- convex optimization
- feasible solution
- integer program
- facet defining inequalities
- linear program
- cover inequalities