Reproduce “Integer programs with nearly totally unimodular matrices: the cographic case” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Manuel Aprile, Samuel Fiorini, Gwenaël Joret, Stefan Kober, Michał T. Seweryn, Stefan Weltge, Yelena Yuditsky
The authors give a strongly polynomial-time algorithm for integer programs whose constraint matrices have square subdeterminants bounded by a fixed constant and become transposes of network matrices after deleting a fixed number of rows and columns. The method isolates the exceptional constraints and uses graph structure to optimize them. This guarantee applies to the stated cographic class, not integer programs generally.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.