Tightening simple mixed-integer sets with guaranteed bounds.

Daniel Bienstock Benjamin McClosky

Published in: Math. Program. (2012)

Keyphrases

mixed integer
totally unimodular
convex hull
lot sizing
mixed integer programming
linear program
lagrangian heuristic
neural network
upper bound
bayesian networks
search algorithm
worst case
maximum likelihood
continuous variables