{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T20:09:58Z","timestamp":1768075798856,"version":"3.49.0"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,10,8]],"date-time":"2014-10-08T00:00:00Z","timestamp":1412726400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1007\/s10107-014-0823-8","type":"journal-article","created":{"date-parts":[[2014,10,7]],"date-time":"2014-10-07T14:57:14Z","timestamp":1412693834000},"page":"687-713","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":27,"title":["A polynomial projection algorithm for linear feasibility problems"],"prefix":"10.1007","volume":"153","author":[{"given":"Sergei","family":"Chubanov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,10,8]]},"reference":[{"key":"823_CR1","doi-asserted-by":"crossref","unstructured":"Agmon, Sh.: The relaxation method for linear inequalities. Can. J. Math. 6, 382\u2013392 (1954)","DOI":"10.4153\/CJM-1954-037-2"},{"key":"823_CR2","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1007\/s10107-011-0445-3","volume":"134","author":"S Chubanov","year":"2012","unstructured":"Chubanov, S.: A strongly polynomial algorithm for linear systems having a binary solution. Math. Program. 134, 533\u2013570 (2012)","journal-title":"Math. Program."},{"key":"823_CR3","unstructured":"Dantzig, G.: An $$\\varepsilon $$ \u03b5 -precise feasible solution to a linear program with a convexity constraint in $$1\/\\varepsilon ^2$$ 1 \/ \u03b5 2 iterations independent of problem size. Tech. rep. SOL 92\u20135 (1992)"},{"key":"823_CR4","doi-asserted-by":"crossref","first-page":"241","DOI":"10.6028\/jres.071B.033","volume":"71 B","author":"J Edmonds","year":"1967","unstructured":"Edmonds, J.: Systems of distinct representatives and linear algebra. J. Res. Nat. Bur. Stand. 71 B, 241\u2013245 (1967)","journal-title":"J. Res. Nat. Bur. Stand."},{"key":"823_CR5","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1287\/moor.5.3.388","volume":"5","author":"JL Goffin","year":"1980","unstructured":"Goffin, J.L.: The relaxation method for solving systems of linear inequalities. Math. Oper. Res. 5, 388\u2013414 (1980)","journal-title":"Math. Oper. Res."},{"key":"823_CR6","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/BF01581028","volume":"22","author":"JL Goffin","year":"1982","unstructured":"Goffin, J.L.: On the non-polynomiality of the relaxation method for systems of linear inequalities. Math. Program. 22, 93\u2013103 (1982)","journal-title":"Math. Program."},{"key":"823_CR7","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1137\/1031049","volume":"31","author":"WW Hager","year":"1989","unstructured":"Hager, W.W.: Updating the inverse of a matrix. SIAM Rev. 31, 221\u2013239 (1989)","journal-title":"SIAM Rev."},{"key":"823_CR8","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":"823_CR9","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":"823_CR10","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1137\/0802028","volume":"2","author":"S Mehrotra","year":"1992","unstructured":"Mehrotra, S.: On the implementation of a primal-dual interior point method. SIAM J. Optim. 2, 575\u2013601 (1992)","journal-title":"SIAM J. Optim."},{"key":"823_CR11","doi-asserted-by":"crossref","unstructured":"Motzkin, Th., Schoenberg, I.J.: The relaxation method for linear inequalities. Can. J. Math. 6, 393\u2013404 (1954)","DOI":"10.4153\/CJM-1954-038-x"},{"key":"823_CR12","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF01580724","volume":"40","author":"J Renegar","year":"1988","unstructured":"Renegar, J.: A polynomial-time algorithm, based on Newton\u2019s method, for linear programming. Math. Program. 40, 59\u201393 (1988)","journal-title":"Math. Program."},{"key":"823_CR13","unstructured":"Roos, C.: Speeding up Chubanov\u2019s method for solving a homogeneous inequality system. Optimization Online, Report 2013\u2013100, TU Delft, NL, September (2013)"},{"key":"823_CR14","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1007\/BF01458147","volume":"76","author":"E Stiemke","year":"1915","unstructured":"Stiemke, E.: \u00dcber positive L\u00f6sungen homogener linearer Gleichungen. Math. Ann. 76, 340\u2013342 (1915)","journal-title":"Math. Ann."},{"key":"823_CR15","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. Program. 91, 417\u2013436 (2002)","journal-title":"Math. Program."},{"key":"823_CR16","unstructured":"Zhang, Y.: Solving Large-Scale Linear Programs by Interior-point Methods Under the MATLAB Environment. Technical Report TR96-01, Department of Mathematics and Statistics, University of Maryland, Baltimore County, Baltimore, MD (1995)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-014-0823-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-014-0823-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-014-0823-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T10:00:06Z","timestamp":1559124006000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-014-0823-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,8]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["823"],"URL":"https:\/\/doi.org\/10.1007\/s10107-014-0823-8","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,8]]}}}