{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T22:36:00Z","timestamp":1718922960533},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"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":[[1994,3]]},"DOI":"10.1007\/bf01582579","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:39:29Z","timestamp":1114677569000},"page":"325-336","source":"Crossref","is-referenced-by-count":19,"title":["New algorithms for generalized network flows"],"prefix":"10.1007","volume":"64","author":[{"given":"Edith","family":"Cohen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nimrod","family":"Megiddo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"955","DOI":"10.1287\/opre.39.6.955","volume":"39","author":"I. Adler","year":"1991","unstructured":"I. Adler and S. Cosares, \u201cA strongly polynomial algorithm for a special class of linear programs,\u201dOperations Research 39 (1991) 955\u2013960.","journal-title":"Operations Research"},{"key":"CR2","volume-title":"Combinatorial Algorithms for optimization problems","author":"E. Cohen","year":"1991","unstructured":"E. Cohen, \u201cCombinatorial Algorithms for optimization problems PhD thesis, Department of Computer Science, Stanford University, Stanford, Ca, 1991."},{"key":"CR3","first-page":"145","volume-title":"Proceedings of the 23rd Annual ACM Symposium on Theory of Computing","author":"E. Cohen","year":"1991","unstructured":"E. Cohen and N. Megiddo, \u201cImproved algorithms for linear inequalities with two variables per inequality,\u201d in:Proceedings of the 23rd Annual ACM Symposium on Theory of Computing (ACM, New York, 1991) 145\u2013155."},{"key":"CR4","first-page":"103","volume-title":"Proceedings of the 1st Israeli Symposium on the Theory of Computing and Systems, Lecture Notes in Computer Science Vol. 601","author":"E. Cohen","year":"1992","unstructured":"E. Cohen and N. Megiddo, \u201cNew algorithms for generalized network flows,\u201d in: D. Dolev, Z. Galil and M. Rodeh, eds.,Proceedings of the 1st Israeli Symposium on the Theory of Computing and Systems, Lecture Notes in Computer Science Vol. 601 (Springer-Verlag, Berlin, 1992) 103\u2013114."},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"E. Cohen and N. Megiddo, \u201cImproved algorithms for linear inequalities with two variables per inequality,\u201dSIAM Journal on Computing (1993) to appear.","DOI":"10.1137\/S0097539791256325"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01584992","volume":"3","author":"R.W. Cottle","year":"1972","unstructured":"R.W. Cottle and A.F. Veinott Jr., \u201cPolyhedral sets having a least element,\u201dMathematical Programming 3 (1972) 238\u2013249.","journal-title":"Mathematical Programming"},{"key":"CR7","volume-title":"Engineering Summer Conference","author":"J. Edmonds","year":"1967","unstructured":"J. Edmonds, \u201cAn introduction to matchings,\u201d in:Engineering Summer Conference, The University of Michigan, Ann Arbor (1967) Mimeographed notes."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"1209","DOI":"10.1287\/mnsc.24.12.1209","volume":"24","author":"F. Glover","year":"1978","unstructured":"F. Glover, J. Hultz, D. Klingman and J. Stunz, \u201cGeneralized networks: a fundamental computer-based planning tool,\u201dManagement Science 24 (August 1978) 1209\u20131220.","journal-title":"Management Science"},{"key":"CR9","first-page":"432","volume-title":"Proceedings of the 29th IEEE Annual Symposium on Foundations of Computer Science","author":"A.V. Goldberg","year":"1988","unstructured":"A.V. Goldberg, S.K. Plotkin and \u00c9. Tardos, \u201cCombinatorial algorithms for the generalized circulation problem,\u201d in:Proceedings of the 29th IEEE Annual Symposium on Foundations of Computer Science (IEEE Press, New York, 1988) pp. 432\u2013443."},{"key":"CR10","volume-title":"Graphs and Algorithms","author":"M. Gondran","year":"1984","unstructured":"M. Gondran and M. Minoux, \u201cGraphs and Algorithms (John Wiley & Sons, New York, 1984)."},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"K. Kapoor and P.M. Vaidya, \u201cSpeeding up Karmarkar's algorithm for multicommodity flows,\u201dMathematical Programming, to appear.","DOI":"10.1007\/BF02592100"},{"key":"CR12","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E.L. Lawler","year":"1976","unstructured":"E.L. Lawler,Combinatorial Optimization: Networks and Matroids (Holt, Reinhart and Winston, New York, 1976)."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1137\/0212022","volume":"12","author":"N. Megiddo","year":"1983","unstructured":"N. Megiddo, \u201cTowards a genuinely polynomial algorithm for linear programming,\u201dSIAM Journal on Computing 12 (1983) 347\u2013353.","journal-title":"SIAM Journal on Computing"},{"key":"CR14","unstructured":"S. Murray, \u201cAn interior point conjugate gradient approach to the generalized flow problem with costs and the multicommodity flow problem dual,\u201d manuscript, 1991."},{"key":"CR15","first-page":"377","volume-title":"Proceedings of the 20th Annual ACM Symposium on Theory of Computing","author":"J.B. Orlin","year":"1988","unstructured":"J.B. Orlin, \u201cA faster strongly polynomial minimum cost flow algorithm,\u201d in:Proceedings of the 20th Annual ACM Symposium on Theory of Computing (ACM, New York, 1988) 377\u2013387."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1287\/opre.34.2.250","volume":"34","author":"\u00c9. Tardos","year":"1986","unstructured":"\u00c9. Tardos, \u201cA strongly polynomial algorithm to solve combinatorial linear programs,\u201dOperations Research 34 (1986) 250\u2013256.","journal-title":"Operations Research"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1109\/SFCS.1989.63499","volume-title":"Proceedings of the 30th IEEE Annual Symposium on Foundations of Computer Science","author":"P.M. Vaidya","year":"1989","unstructured":"P.M. Vaidya, \u201cSpeeding-up linear programming using fast matrix multiplication,\u201d in:Proceedings of the 30th IEEE Annual Symposium on Foundations of Computer Science (IEEE Press, New York, 1989) 332\u2013337."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582579.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01582579\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582579","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T03:47:21Z","timestamp":1586231241000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01582579"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":17,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["BF01582579"],"URL":"https:\/\/doi.org\/10.1007\/bf01582579","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}