Showing math.OCShow all
2 papers · 1 filter
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…
math.OC2021
Computational Aspects of Relaxation Complexity: Possibilities and Limitations
Gennadiy Averkov, Christopher Hojny, Matthias Schymura
The relaxation complexity of the set of integer points contained in a polyhedron is the smallest number of facets of any polyhedron such that the integer p…