Total weak unimodularity: testing and applications

Abstract The concept of total weak unimodularity for an integral matrix is introduced. Connections are shown to existing and well studied ideas such as TDI and integer rounding. Algorithms are provided for testing total weak unimodularity and producing integral solutions to inequality systems when they exist under the assumption of total weak unimodularity.

[1]  Ravi Kannan,et al.  Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix , 1979, SIAM J. Comput..

[2]  Paul D. Seymour,et al.  The matroids with the max-flow min-cut property , 1977, J. Comb. Theory B.

[3]  Henry J. Stephen Smith,et al.  XV. On systems of linear indeterminate equations and congruences , 1861, Philosophical Transactions of the Royal Society of London.

[4]  J. Edmonds,et al.  A Min-Max Relation for Submodular Functions on Graphs , 1977 .

[5]  W. Pulleyblank.  Dual integrality in b-matching problems , 1980 .

[6]  D. R. Fulkerson,et al.  On balanced matrices , 1974 .

[7]  Alexander Schrijver,et al.  On total dual integrality , 1981 .

[8]  James B. Orlin,et al.  Cyclic Scheduling via Integer Programs with Circular Ones , 1980, Oper. Res..

[9]  D. R. Fulkerson,et al.  Blocking and anti-blocking pairs of polyhedra , 1971, Math. Program..

[10]  W. Cunningham,et al.  A primal algorithm for optimum matching , 1978 .

[11]  J. Edmonds.  Minimum partition of a matroid into independent subsets , 1965 .

[12]  J. Stoer,et al.  Convexity and Optimization in Finite Dimensions I , 1970 .

[13]  T. C. Hu.  Two-commodity cut-packing problem , 1973, Math. Program..

[14]  Jack Edmonds,et al.  Matroids and the greedy algorithm , 1971, Math. Program..

[15]  D. R. Fulkerson,et al.  Packing rooted directed cuts in a weighted directed graph , 1974, Math. Program..

[16]  Robert G. Jeroslow,et al.  Some Basis Theorems for Integral Monoids , 1978, Math. Oper. Res..

[17]  Leslie E. Trotter,et al.  Finite checkability for integer rounding properties in combinatorial programming problems , 1982, Math. Program..

[18]  R. Chandrasekaran.  Polynomial Algorithms for Totally Dual Integral Systems and Extensions , 1981 .

[19]  Alan J. Hoffman,et al.  A generalization of max flow—min cut , 1974, Math. Program..