Login / Signup
Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions.
Natashia Boland
Santanu S. Dey
Thomas Kalinowski
Marco Molinaro
Fabian Rigterink
Published in:
Math. Program. (2017)
Keyphrases
</>
convex hull
continuous relaxation
computational geometry
convex polyhedra
point sets
feasible solution
mixed integer
linear inequalities
convex sets
integer points
training samples
continuous variables
minimum distance
valid inequalities
data points
dynamic programming
simple polygon
objective function
training data