lifting
swMATH ID:  31749 
Software Authors:  Fukasawa, Ricardo; Poirrier, Laurent; Xavier, Álinson S. 
Description:  The (not so) trivial lifting in two dimensions. When generating cuttingplanes for mixedinteger programs from multiple rows of the simplex tableau, the usual approach has been to relax the integrality of the nonbasic variables, compute an intersection cut, then strengthen the cut coefficients corresponding to integral nonbasic variables using the socalled trivial lifting procedure. Although of polynomialtime complexity in theory, this lifting procedure can be computationally costly in practice. For the case of tworow relaxations, we present a practical algorithm that computes trivial lifting coefficients in constant time, for arbitrary maximal latticefree sets. Computational experiments confirm that the algorithm works well in practice. 
Homepage:  https://rd.springer.com/article/10.1007%2Fs1253201801465 
Source Code:  https://zenodo.org/record/1342771#.Xju_5cZKjmI 
Keywords:  integer programming; lifting; cutting planes 
Related Software:  MIPLIB; onerow; CPLEX; infinite group relaxation; MIPLIB2003; gmp 
Cited in:  5 Documents 
Standard Articles
1 Publication describing the Software, including 1 Publication in zbMATH  Year 

The (not so) trivial lifting in two dimensions. Zbl 1434.90104 Fukasawa, Ricardo; Poirrier, Laurent; Xavier, Álinson S. 
2019

all
top 5
Cited by 7 Authors
3  Fukasawa, Ricardo 
3  Poirrier, Laurent 
3  Xavier, Álinson S. 
1  Balas, Egon 
1  Basu, Amitabh 
1  Sankaranarayanan, Sriram 
1  Serra, Thiago R. 
Cited in 3 Serials
2  INFORMS Journal on Computing 
2  Mathematical Programming Computation 
1  SIAM Journal on Optimization 
Cited in 1 Field
5  Operations research, mathematical programming (90XX) 