Sciweavers

SODA
2010
ACM
133views Algorithms» more  SODA 2010»
15 years 10 months ago
Testing additive integrality gaps
We consider the problem of testing whether the maximum additive integrality gap of a family of integer programs in standard form is bounded by a given constant. This can be viewed...
Friedrich Eisenbrand, Nicolai Hähnle, Dömötör ...