{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:14:50Z","timestamp":1725459290702},"publisher-location":"Berlin\/Heidelberg","reference-count":16,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540555536"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0035170","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T15:20:01Z","timestamp":1138202401000},"page":"103-114","source":"Crossref","is-referenced-by-count":3,"title":["New algorithms for generalized network flows"],"prefix":"10.1007","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":"10_CR1","doi-asserted-by":"crossref","unstructured":"I. Adler and S. Cosares. Strongly polynomial algorithms for linear programming problems with special structure. Oper. Res., 1991. To appear.","DOI":"10.1287\/opre.39.6.955"},{"key":"10_CR2","volume-title":"PhD thesis","author":"E. Cohen","year":"1991","unstructured":"E. Cohen. Combinatorial Algorithms for Optimization Problems. PhD thesis, Department of Computer Science, Stanford University, Stanford, Ca., 1991."},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"E. Cohen and N. Megiddo. Improved algorithms for linear inequalities with two variables per inequality. In Proc. 23rd Annual ACM Symposium on Theory of Computing, pages 145\u2013155. ACM, 1991.","DOI":"10.1145\/103418.103438"},{"key":"10_CR4","volume-title":"Technical Report RJ 8187 (75146)","author":"E. Cohen","year":"1991","unstructured":"E. Cohen and N. Megiddo. Improved algorithms for linear inequalities with two variables per inequality. Technical Report RJ 8187 (75146), IBM Almaden Research Center, San Jose, CA 95120-6099, June 1991."},{"key":"10_CR5","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. Polyhedral sets having a least element. Math. Prog., 3:238\u2013249, 1972.","journal-title":"Math. Prog."},{"key":"10_CR6","volume-title":"Engineering Summer Conference","author":"J. Edmonds","year":"1967","unstructured":"J. Edmonds. An introduction to matchings. In Engineering Summer Conference. The Univ. of Michigan, Ann Arbor, 1967. Mimeographed notes."},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"F. Glover, J. Hultz, D. Klingman, and J. Stunz. Generalized networks: a fundamental computer-based planning tool. Management Science, 24(12), August 1978.","DOI":"10.1287\/mnsc.24.12.1209"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"A. V. Goldberg, S. K. Plotkin, and \u00c9. Tardos. Combinatorial algorithms for the generalized circulation problem. In Proc. 29th IEEE Annual Symposium on Foundations of Computer Science, pages 432\u2013443. IEEE, 1988.","DOI":"10.1109\/SFCS.1988.21959"},{"key":"10_CR9","volume-title":"Graphs and Algorithms","author":"M. Gondran","year":"1984","unstructured":"M. Gondran and M. Minoux. Graphs and Algorithms. John Wiley & Sons, New York, 1984."},{"key":"10_CR10","unstructured":"K. Kapoor and P. M. Vaidya. Speeding up Karmarkar's algorithm for multicommodity flows. Math. Prog., 1991. To appear."},{"key":"10_CR11","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":"10_CR12","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1137\/0212022","volume":"12","author":"N. Megiddo","year":"1983","unstructured":"N. Megiddo. Towards a genuinely polynomial algorithm for linear programming. SIAM J. Comput., 12:347\u2013353, 1983.","journal-title":"SIAM J. Comput."},{"key":"10_CR13","unstructured":"S. Murray. An interior point conjugate gradient approach to the generalized flow problem with costs and the multicommodity flow problem dual. Manuscript, 1991."},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"J. B. Orlin. A faster strongly polynomial minimum cost flow algorithm. In Proc. 20th Annual ACM Symposium on Theory of Computing, pages 377\u2013387. ACM, 1988.","DOI":"10.21236\/ADA457044"},{"key":"10_CR15","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1287\/opre.34.2.250","volume":"34","author":"\u00c9. Tardos","year":"1986","unstructured":"\u00c9. Tardos. A strongly polynomial algorithm to solve combinatorial linear programs. Oper. Res., 34:250\u2013256, 1986.","journal-title":"Oper. Res."},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"P. M. Vaidya. Speeding-up linear programming using fast matrix multiplication. In Proc. 30th IEEE Annual Symposium on Foundations of Computer Science, pages 332\u2013337. IEEE, 1989.","DOI":"10.1109\/SFCS.1989.63499"}],"container-title":["Lecture Notes in Computer Science","Theory of Computing and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0035170.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T22:13:14Z","timestamp":1607551994000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0035170"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540555536"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/bfb0035170","relation":{},"subject":[]}}