{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:08:20Z","timestamp":1761620900830},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1992,8,1]],"date-time":"1992-08-01T00:00:00Z","timestamp":712627200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1992,8]]},"DOI":"10.1007\/bf01580905","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T04:58:11Z","timestamp":1114664291000},"page":"321-335","source":"Crossref","is-referenced-by-count":8,"title":["A combinatorial interior point method for network flow problems"],"prefix":"10.1007","volume":"56","author":[{"given":"C.","family":"Wallacher","sequence":"first","affiliation":[]},{"given":"U.","family":"Zimmermann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"A.V. Goldberg and R.E. Tarjan, \u201cFinding minimum cost circulations by canceling negative cycles,\u201d in:Proceedings of 20th ACM Symposium on Theory of Computing (1988) pp. 388\u2013397.","DOI":"10.1145\/62212.62250"},{"key":"CR2","volume-title":"Graphs and Algorithms","author":"M. Gondran","year":"1984","unstructured":"M. Gondran and M. Minoux,Graphs and Algorithms (Wiley, New York, 1984)."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF01588776","volume":"49","author":"C. Gonzaga","year":"1990","unstructured":"C. Gonzaga, \u201cPolynomial affine algorithms for linear programming,\u201dMathematical Programming 49 (1990) 7\u201321.","journal-title":"Mathematical Programming"},{"key":"CR4","volume-title":"\u201cLarge-steps path-following methods for linear programming: Potential reduction method,\u201d Internal Report ES-211\/89","author":"C. Gonzaga","year":"1989","unstructured":"C. Gonzaga, \u201cLarge-steps path-following methods for linear programming: Potential reduction method,\u201d Internal Report ES-211\/89, COPPE \u2014 Federal University of Rio de Janeiro (Rio de Janeiro, 1989)."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar","year":"1984","unstructured":"N. Karmarkar, \u201cA polynomial-time algorithm for linear programming,\u201dCombinatorica 4 (1984) 373\u2013395.","journal-title":"Combinatorica"},{"key":"CR6","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E. Lawler","year":"1976","unstructured":"E. Lawler,Combinatorial Optimization: Networks and Matroids (Holt, Rinehart and Winston, San Francisco, CA, 1976)."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"157","DOI":"10.15807\/jorsj.33.157","volume":"33","author":"K. Masuzawa","year":"1990","unstructured":"K. Masuzawa. S. Mizuno, and M. Mori, \u201cA polynomial time interior point algorithm for minimum cost flow problems,\u201dJournal of the Operations Research Society of Japan 33 (1990) 157\u2013167.","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1287\/moor.4.4.414","volume":"4","author":"N. Megiddo","year":"1979","unstructured":"N. Megiddo, \u201cCombinatorial optimization with rational objective functions,\u201dMathematics of Operations Research 4 (1979) 414\u2013424.","journal-title":"Mathematics of Operations Research"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF01580859","volume":"47","author":"P.M. Vaidya","year":"1990","unstructured":"P.M. Vaidya, \u201cAn algorithm for linear programming which requires O(((m+n)n 2+(m+n) 1.5 n)L) arithmetic operations,\u201dMathematical Programming 47 (1990) 175\u2013201.","journal-title":"Mathematical Programming"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580905.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01580905\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580905","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:12:12Z","timestamp":1556881932000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01580905"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,8]]},"references-count":9,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1992,8]]}},"alternative-id":["BF01580905"],"URL":"https:\/\/doi.org\/10.1007\/bf01580905","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,8]]}}}