A strongly polynomial algorithm for linear systems having a binary solution
成果类型：
Article
署名作者：
Chubanov, Sergei
署名单位：
Universitat Siegen
刊物名称：
MATHEMATICAL PROGRAMMING
ISSN/ISSBN：
0025-5610
DOI：
10.1007/s10107-011-0445-3
发表日期：
2012
页码：
533-570
关键词：
摘要：
This paper proposes a strongly polynomial algorithm which either finds a solution of a linear system Ax = b, 0 a parts per thousand currency sign x a parts per thousand currency sign 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.
来源URL：