1 problem

0 votes0 replies0 views
The polynomial-time solvability conjecture for totally -modular integer programs
Totally $\Delta$ -modular integer-program conjecture. For any constant $\Delta$ , this integer program can be solved in polynomial time when $A$ is totally $\Delta$ -modular.
Conjectureopencombinatorial-optimization integer-programming totally-modular-matricesarXiv posted 2 days ago

The polynomial-time solvability conjecture for totally -modular integer programs