[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

A strongly polynomial algorithm for linear systems having a binary solution

  • Full Length Paper
  • Series A
  • Published:
Mathematical Programming Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Agmon Sh.: The relaxation method for linear inequalities. Can. J. Math. 6, 382–392 (1954)

    Article  MathSciNet  MATH  Google Scholar 

  2. Chubanov, S.: A polynomial relaxation-type algorithm for linear programming. http://www.optimization-online.org/DB_HTML/2011/02/2915.html (2010)

  3. Edmonds J.: Systems of distinct representatives and linear algebra. J. Res. Nat. Bur. Standards 71B, 241–245 (1967)

    MathSciNet  Google Scholar 

  4. Karmarkar N.: A new polynomial-time algorithm for linear programming. Combinatorica 4, 353–395 (1984)

    Article  MathSciNet  Google Scholar 

  5. Khachiyan, L.G.: A polynomial algorithm in linear programming. Dokl. Akad. Nauk SSSR 244 (English translation: Soviet Math. Dokl. 20, 191–194) (1979)

    Google Scholar 

  6. Motzkin Th., Schoenberg I.J.: The relaxation method for linear inequalities. Can. J. Math. 6, 393–404 (1954)

    Article  MathSciNet  MATH  Google Scholar 

  7. Tardos E.: A strongly polynomial algorithm to solve combinatorial linear programs. Oper. Res. 34, 250–256 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  8. Todd M.: The many facets of linear programming. Math. Programm. 91, 417–436 (2002)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Information Systems, University of Siegen, Siegen, Germany

    Sergei Chubanov

Authors
  1. Sergei Chubanov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sergei Chubanov.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chubanov, S. A strongly polynomial algorithm for linear systems having a binary solution. Math. Program. 134, 533–570 (2012). https://doi.org/10.1007/s10107-011-0445-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-011-0445-3

Mathematics Subject Classification (2010)

Search

Navigation