Integer Programs with Nearly Totally Unimodular Matrices: The Cographic Case
- 9 June 2026
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
Abstract
It is a notorious open question whether integer programs (IPs) with an integer coefficient matrix M whose subdeterminants are all bounded by a constant [ ] in absolute value can be solved in polynomial time. We answer this question in the affirmative if we further require that, by removing a constant number of rows and columns from M, one obtains a submatrix A that is the transpose of a network matrix. Our approach focuses on the case in which A arises from M after removing k rows only and k is a constant. We achieve our result in two main steps, the first related to the theory of IPs and the second related to graph minor theory. First, we derive a strong proximity result for the case in which A is a general totally unimodular matrix: given an optimal solution of the linear programming relaxation, an optimal solution to the IP can be obtained by finding a constant number of augmentations by circuits of [ ]. Second, for the case in which A is the transpose of a network matrix, we reformulate the problem as a maximum constrained integer potential problem on a graph G. We observe that, if G is two-connected, then it has no rooted [ ]-minor for [ ]. We leverage this to obtain a tree-decomposition of G into highly structured graphs for which we can solve the problem locally. This allows us to solve the global problem via dynamic programming. Funding: M. Aprile and S. Fiorini acknowledge funding from Fonds de la Recherche Scientifique (FNRS) through research project BD-DELTA [Grant PDR 20222190, 2021–24]. S. Fiorini was also funded by the King Baudouin Foundation through project BD-DELTA-2 (convention 2023-F2150080-233051, 2023–26). G. Joret and M. Seweryn acknowledge funding from FNRS (PDR “Product structure of planar graphs”). S. Kober and S. Weltge were supported by the Deutsche Forschungsgemeinschaft (German Research Foundation) [Grants 277991500/GRK2201 and 451026932, respectively]. Y. Yuditsky was supported by FNRS as a postdoctoral researcher.Keywords
This publication has 55 references indexed in Scilit:
- Advances on Strictly $\varDelta $-Modular IPs2023
- Improving the Cook et al. Proximity Bound Given Integral Valued Constraints2022
- Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles2020
- Partially-Ordered Knapsack and Applications to SchedulingLecture Notes in Computer Science, 2002
- Labeled K2, t Minors in Plane GraphsJournal of Combinatorial Theory, Series B, 2002
- Face Covers and the Genus Problem for Apex GraphsJournal of Combinatorial Theory, Series B, 2001
- Random walks, totally unimodular matrices, and a randomised dual simplex algorithmMathematical Programming, 1994
- Sensitivity theorems in integer linear programmingMathematical Programming, 1986
- On minors of non-binary matroidsCombinatorica, 1981
- Eine Verallgemeinerung desn-fachen Zusammenhangs f r GraphenMathematische Annalen, 1970