11 citations · 47 across the 48 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
math.OC2022
The role of rationality in integer-programming relaxations
Manuel Aprile, Gennadiy Averkov, Marco Di Summa +1
For a finite set that can be represented as for some polyhedron , we call a relaxation of and define the relaxation co…
math.OC2022
Efficient MIP Techniques for Computing the Relaxation Complexity
Gennadiy Averkov, Christopher Hojny, Matthias Schymura
The relaxation complexity rc(X) of the set of integer points X contained in a polyhedron is the minimal number of inequalities needed to formulate a linear optimization problem ove…