TY - JOUR
T1 - Lifted tableaux inequalities for 0-1 mixed-integer programs
T2 - A computational study
AU - Narisetty, Amar K.
AU - Richard, Jean Philippe P.
AU - Nemhauser, George L.
PY - 2011/6
Y1 - 2011/6
N2 - We describe families of inequalities for 0-1 mixed-integer programming problems that are obtained by lifting cover and packing inequalities. We show that these inequalities can be separated from single rows of the simplex tableaux of their linear programming relaxations. We present the results of a computational study comparing their performance with that of Gomory mixed-integer cuts on a collection of MIPLIB and randomly generated 0-1 mixed-integer programs. The computational study shows that these cuts yield better results than Gomory mixed-integer cuts.
AB - We describe families of inequalities for 0-1 mixed-integer programming problems that are obtained by lifting cover and packing inequalities. We show that these inequalities can be separated from single rows of the simplex tableaux of their linear programming relaxations. We present the results of a computational study comparing their performance with that of Gomory mixed-integer cuts on a collection of MIPLIB and randomly generated 0-1 mixed-integer programs. The computational study shows that these cuts yield better results than Gomory mixed-integer cuts.
KW - Cutting planes
KW - Lifting
KW - Mixed-integer programming
KW - Simplex tableaux cuts
UR - http://www.scopus.com/inward/record.url?scp=79961036998&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79961036998&partnerID=8YFLogxK
U2 - 10.1287/ijoc.1100.0413
DO - 10.1287/ijoc.1100.0413
M3 - Article
AN - SCOPUS:79961036998
SN - 1091-9856
VL - 23
SP - 416
EP - 424
JO - INFORMS Journal on Computing
JF - INFORMS Journal on Computing
IS - 3
ER -