Between Steps: Intermediate Relaxations Between Big-M and Convex Hull Formulations.
Jan KronqvistRuth MisenerCalvin TsayPublished in: CPAIOR (2021)
Keyphrases
- convex hull
- valid inequalities
- linear programming relaxation
- lower bound
- convex polyhedra
- mixed integer
- point sets
- feasible solution
- np hard
- minimum distance
- lp relaxation
- convex sets
- simple polygon
- convex concave
- computational geometry
- linear programming
- objective function
- extreme points
- continuous variables
- pairwise
- finite set of points