论文信息 - A POLYNOMIAL-TIME TEST FOR TOTAL DUAL INTEGRALITY IN FIXED DIMENSION - 字舞流文

A POLYNOMIAL-TIME TEST FOR TOTAL DUAL INTEGRALITY IN FIXED DIMENSION

In this note we show that, for any fixed number r, there exists a polynomial-time algorithm to test whether a given system of linear inequalities Ax≤b is totally dual integral, where A is an integer matrix of rank r.

L. Lovász | A. Schrijver | W. Cook

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

[2] W. Pulleyblank,et al. Total Dual Integrality and Integer Polyhedra , 1979 .

[3] L. G. H. Cijan. A polynomial algorithm in linear programming , 1979 .

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

[5] L. Khachiyan. Polynomial algorithms in linear programming , 1980 .

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

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

[8] Hendrik W. Lenstra,et al. Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..

[9] Ramaswamy Chandrasekaran,et al. Total weak unimodularity: testing and applications , 1984, Discret. Math..