{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:10:58Z","timestamp":1761621058404},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,2,27]],"date-time":"2011-02-27T00:00:00Z","timestamp":1298764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1007\/s10107-011-0445-3","type":"journal-article","created":{"date-parts":[[2011,2,26]],"date-time":"2011-02-26T02:39:32Z","timestamp":1298687972000},"page":"533-570","source":"Crossref","is-referenced-by-count":29,"title":["A strongly polynomial algorithm for linear systems having a binary solution"],"prefix":"10.1007","volume":"134","author":[{"given":"Sergei","family":"Chubanov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,2,27]]},"reference":[{"key":"445_CR1","doi-asserted-by":"crossref","first-page":"382","DOI":"10.4153\/CJM-1954-037-2","volume":"6","author":"Sh. Agmon","year":"1954","unstructured":"Agmon Sh.: The relaxation method for linear inequalities. Can. J. Math. 6, 382\u2013392 (1954)","journal-title":"Can. J. Math."},{"key":"445_CR2","unstructured":"Chubanov, S.: A polynomial relaxation-type algorithm for linear programming. http:\/\/www.optimization-online.org\/DB_HTML\/2011\/02\/2915.html (2010)"},{"key":"445_CR3","doi-asserted-by":"crossref","first-page":"241","DOI":"10.6028\/jres.071B.033","volume":"71B","author":"J. Edmonds","year":"1967","unstructured":"Edmonds J.: Systems of distinct representatives and linear algebra. J. Res. Nat. Bur. Standards 71B, 241\u2013245 (1967)","journal-title":"J. Res. Nat. Bur. Standards"},{"key":"445_CR4","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar","year":"1984","unstructured":"Karmarkar N.: A new polynomial-time algorithm for linear programming. Combinatorica 4, 353\u2013395 (1984)","journal-title":"Combinatorica"},{"key":"445_CR5","unstructured":"Khachiyan, L.G.: A polynomial algorithm in linear programming. Dokl. Akad. Nauk SSSR 244 (English translation: Soviet Math. Dokl. 20, 191\u2013194) (1979)"},{"key":"445_CR6","doi-asserted-by":"crossref","first-page":"393","DOI":"10.4153\/CJM-1954-038-x","volume":"6","author":"Th. Motzkin","year":"1954","unstructured":"Motzkin Th., Schoenberg I.J.: The relaxation method for linear inequalities. Can. J. Math. 6, 393\u2013404 (1954)","journal-title":"Can. J. Math."},{"key":"445_CR7","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1287\/opre.34.2.250","volume":"34","author":"E. Tardos","year":"1986","unstructured":"Tardos E.: A strongly polynomial algorithm to solve combinatorial linear programs. Oper. Res. 34, 250\u2013256 (1986)","journal-title":"Oper. Res."},{"key":"445_CR8","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/s101070100261","volume":"91","author":"M. Todd","year":"2002","unstructured":"Todd M.: The many facets of linear programming. Math. Programm. 91, 417\u2013436 (2002)","journal-title":"Math. Programm."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-011-0445-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-011-0445-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-011-0445-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:50:09Z","timestamp":1559123409000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-011-0445-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2,27]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["445"],"URL":"https:\/\/doi.org\/10.1007\/s10107-011-0445-3","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2,27]]}}}