论文信息 - A strongly polynomial algorithm for linear systems having a binary solution

A strongly polynomial algorithm for linear systems having a binary solution

This paper proposes a strongly polynomial algorithm which either finds a solution of a linear system Ax = b, 0 ≤ x ≤ 1, or correctly decides that the system has no 0,1-solutions. The algorithm can be used as the basis for the construction of a polynomial algorithm for linear programming.

Sergei Chubanov

[1] Sergei Chubanov. A polynomial relaxation-type algorithm for linear programming , 2011 .

[2] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, STOC '84.

[3] Michael J. Todd,et al. The many facets of linear programming , 2002, Math. Program..

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

[5] I. J. Schoenberg,et al. The Relaxation Method for Linear Inequalities , 1954, Canadian Journal of Mathematics.

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

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

[8] J. Edmonds. Systems of distinct representatives and linear algebra , 1967 .