On a class of strong valid inequalities for the connected matching polytope.
Phillippe SamerPublished in: CoRR (2023)
Keyphrases
- facet defining inequalities
- valid inequalities
- facet defining
- traveling salesman problem
- integer programming
- mixed integer
- convex hull
- integer programming problems
- linear programming
- lower and upper bounds
- mixed integer programming
- cutting plane algorithm
- cutting plane
- feasible solution
- linear programming relaxation
- mixed integer linear programs
- integer program
- integer programming formulation
- high dimensional