Introduces TDM-treewidth for graphic matrices with two nonzeros per row and proves polynomial-time solvability for bounded-width integer programs with bounded domains, plus a grid theorem analogue.
[GLS84] Martin Grötschel, László Lovász, and Alexander Schrijver
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Totally $\Delta$-Modular Tree Decompositions of Graphic Matrices for Integer Programming
Introduces TDM-treewidth for graphic matrices with two nonzeros per row and proves polynomial-time solvability for bounded-width integer programs with bounded domains, plus a grid theorem analogue.