A strongly polynomial algorithm for bimodular integer linear programming

We present a strongly polynomial algorithm to solve integer programs of the form max{cT x: Ax≤ b, xεℤn }, for AεℤmXn with rank(A)=n, bε≤m, cε≤n, and where all determinants of (nXn)-sub-matrices of A are bounded by 2 in absolute value. In particular, this implies that integer programs max{cT x : Q x≤ b, xεℤ≥0n}, where Qε ℤmXn has the property that all subdeterminants are bounded by 2 in absolute value, can be solved in strongly polynomial time. We thus obtain an extension of the well-known result that integer programs with constraint matrices that are totally unimodular are solvable in strongly polynomial time.

[1]  Leonidas S. Pitsoulis,et al.  Optimization with binet matrices , 2007, Oper. Res. Lett..

[2]  Santosh S. Vempala,et al.  A note on non-degenerate integer programs with small sub-determinants , 2016, Oper. Res. Lett..

[3]  Santosh S. Vempala,et al.  Geometric random edge , 2014, Math. Program..

[4]  Carsten Moldenhauer,et al.  Solving the Stable Set Problem in Terms of the Odd Cycle Packing Number , 2014, FSTTCS.

[5]  Alexander Schrijver,et al.  A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time , 2000, J. Comb. Theory, Ser. B.

[6]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[7]  R. Carr,et al.  A Decomposition-Based Pseudoapproximation Algorithm for Network Flow Inhibition , 2003 .

[8]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[9]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[10]  Balázs Kotnyek,et al.  Rational and integral k-regular matrices , 2004, Discret. Math..

[11]  J. Humphreys Polytopes, Graphs and Optimisation , 2022 .

[12]  Sergey I. Veselov,et al.  Integer program with bimodular matrix , 2008, Discret. Optim..

[13]  Rico Zenklusen,et al.  Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives , 2015, Math. Oper. Res..

[14]  Paul D. Seymour,et al.  Decomposition of regular matroids , 1980, J. Comb. Theory, Ser. B.

[15]  James B. Orlin,et al.  A faster strongly polynomial time algorithm for submodular function minimization , 2007, Math. Program..

[16]  Michel X. Goemans,et al.  Minimizing submodular functions over families of sets , 1995, Comb..

[17]  Friedrich Eisenbrand,et al.  On Sub-determinants and the Diameter of Polyhedra , 2011, SoCG '12.

[18]  Martin E. Dyer,et al.  Random walks, totally unimodular matrices, and a randomised dual simplex algorithm , 1994, IPCO.

[19]  Irwin E. Schochetman,et al.  On the minors of an incidence matrix and its Smith normal form , 1995 .

[20]  Robert E. Bixby,et al.  Short Cocircuits in Binary Matroids , 1987, Eur. J. Comb..

[21]  Satoru Iwata,et al.  A combinatorial strongly polynomial algorithm for minimizing submodular functions , 2001, JACM.

[22]  Éva Tardos,et al.  A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs , 1986, Oper. Res..