TY  - JOUR
A1  - Fukasawa, Ricardo
A1  - Poirrier, Laurent
A1  - Xavier, Álinson S.
T1  - The (not so) trivial lifting in two dimensions
T2  - Mathematical Programming Computation
N2  - When generating cutting-planes for mixed-integer programs from multiple rows of the simplex tableau, the usual approach has been to relax the integrality of the non-basic variables, compute an intersection cut, then strengthen the cut coefficients corresponding to integral non-basic variables using the so-called trivial lifting procedure. Although of polynomial-time complexity in theory, this lifting procedure can be computationally costly in practice. For the case of two-row relaxations, we present a practical algorithm that computes trivial lifting coefficients in constant time, for arbitrary maximal lattice-free sets. Computational experiments confirm that the algorithm works well in practice.
KW  - Software
KW  - Theoretical Computer Science
Y1  - 2018
UR  - https://opus4.kobv.de/opus4-mpc/frontdoor/index/index/docId/158
SN  - 1867-2949
VL  - 11
IS  - 2
SP  - 211
EP  - 235
PB  - Springer Science and Business Media LLC
ER  -