Login / Signup
On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs.
Yogesh Awate
Gérard Cornuéjols
Bertrand Guenin
Levent Tunçel
Published in:
Math. Program. (2015)
Keyphrases
</>
mixed integer program
mixed integer
feasible solution
lot sizing
linear program
lagrangian relaxation
valid inequalities
cutting plane
continuous variables
computer vision
convex hull
constraint programming
integer programming
objective function
computational complexity
dynamic programming