2 papers
cs.DS2026
Combinatorial optimization with bounded subdeterminants
Samuel Fiorini, J. Pascal Gollin, Tony Huynh +5
We take a first step toward a broader study of classical combinatorial optimization problems through the maximum subdeterminants of their standard integer programming formulations,…
cs.DM2026
The relaxation complexity of the standard simplex is logarithmic
Gennadiy Averkov, Simon Keil, Stefan Weltge
For a set of integer points, the relaxation complexity is the smallest number of facets of any polyhedron such that . In thi…