Lifted Tableaux Inequalities for 0--1 Mixed-Integer Programs: A Computational Study
INFORMS Journal on Computing
Hi-index | 0.00 |
In this paper, we present an approximate lifting scheme to derive valid inequalities for general mixed integer programs and for the group problem. This scheme uses superadditive functions as the building block of integer and continuous lifting procedures. It yields a simple derivation of new and known families of cuts that correspond to extreme inequalities for group problems. This new approximate lifting approach is constructive and potentially efficient in computation.