Between steps: Intermediate relaxations between big-M and convex hull formulations.
Jan KronqvistRuth MisenerCalvin TsayPublished in: CoRR (2021)
Keyphrases
- convex hull
- valid inequalities
- linear programming relaxation
- point sets
- convex sets
- mixed integer
- lower bound
- linear programming
- feasible solution
- training samples
- data points
- convex concave
- np hard
- simple polygon
- upper bound
- bayesian networks
- active learning
- semidefinite
- high resolution
- linear inequalities
- extreme points
- finite set of points