Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Schade, Jamico"'
Standard mixed-integer programming formulations for the stable set problem on $n$-node graphs require $n$ integer variables. We prove that this is almost optimal: We give a family of $n$-node graphs for which every polynomial-size MIP formulation req
Externí odkaz:
http://arxiv.org/abs/2308.16711
The Flatness theorem states that the maximum lattice width ${\rm Flt}(d)$ of a $d$-dimensional lattice-free convex set is finite. It is the key ingredient for Lenstra's algorithm for integer programming in fixed dimension, and much work has been done
Externí odkaz:
http://arxiv.org/abs/2111.08483