Extended formulations for the integer hull of strictly Δ-modular cographic polyhedral cones
Conforti et al. give a compact extended formulation for a class of bimodular-constrained
integer programs, namely those that model the stable set polytope of a graph with no disjoint …
integer programs, namely those that model the stable set polytope of a graph with no disjoint …
A parameterized linear formulation of the integer hull
F Eisenbrand, T Rothvoss - arxiv preprint arxiv:2501.02347, 2025 - arxiv.org
Let $ A\in\mathbb {Z}^{m\times n} $ be an integer matrix with components bounded by
$\Delta $ in absolute value. Cook et al.~(1986) have shown that there exists a universal …
$\Delta $ in absolute value. Cook et al.~(1986) have shown that there exists a universal …
Totally -modular IPs with two non-zeros in most rows
S Kober - arxiv preprint arxiv:2411.15282, 2024 - arxiv.org
Integer programs (IPs) on constraint matrices with bounded subdeterminants are
conjectured to be solvable in polynomial time. We give a strongly polynomial time algorithm …
conjectured to be solvable in polynomial time. We give a strongly polynomial time algorithm …