Tight Cycle Relaxations for the Cut Polytope.
Carla MichiniPublished in: SIAM J. Discret. Math. (2021)
Keyphrases
- lower bound
- facet defining inequalities
- semidefinite
- upper bound
- facet defining
- lattice points
- valid inequalities
- linear programming
- stable set
- semidefinite programming
- convex hull
- np hard
- convex relaxation
- worst case
- lower and upper bounds
- linear programming relaxation
- objective function
- traveling salesman problem
- mixed integer
- branch and bound
- integer programming problems
- optimal solution
- generalization error bounds
- knapsack problem
- cutting plane
- real time
- np complete
- computational complexity
- learning algorithm