{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T14:28:27Z","timestamp":1656253707812},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540645900","type":"print"},{"value":"9783540693468","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-69346-7_24","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T11:51:29Z","timestamp":1186055489000},"page":"310-324","source":"Crossref","is-referenced-by-count":17,"title":["Simple Generalized Maximum Flow Algorithms"],"prefix":"10.1007","author":[{"given":"\u00c9va","family":"Tardos","sequence":"first","affiliation":[]},{"given":"Kevin D.","family":"Wayne","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1998,6,18]]},"reference":[{"key":"24_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R. K. Ahuja","year":"1993","unstructured":"R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, New Jersey, 1993."},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF01582579","volume":"64","author":"E. Cohen","year":"1994","unstructured":"Edith Cohen and Nimrod Megiddo. New algorithms for generalized network flows. Math Programming, 64:325\u2013336, 1994.","journal-title":"Math Programming"},{"key":"24_CR3","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. Stutz. Generalized networks: A fundamental computer based planning tool. Management Science, 24:1209\u20131220, 1978.","journal-title":"Management Science"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01584670","volume":"4","author":"F. Glover","year":"1973","unstructured":"F. Glover and D. Klingman. On the equivalence of some generalized network flow problems to pure network problems. Math Programming, 4:269\u2013278, 1973.","journal-title":"Math Programming"},{"key":"24_CR5","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1287\/inte.20.4.7","volume":"20","author":"F. Glover","year":"1990","unstructured":"F. Glover, D. Klingman, and N. Phillips. Netform modeling and applications. Interfaces, 20:7\u201327, 1990.","journal-title":"Interfaces"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"A. V. Goldberg, S. A. Plotkin, and \u00c9 Tardos. Combinatorial algorithms for the generalized circulation problem. Technical Report STAN-CS-88-1209, Stanford University, 1988.","DOI":"10.21236\/ADA197409"},{"key":"24_CR7","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1287\/moor.16.2.351","volume":"16","author":"A. V. Goldberg","year":"1991","unstructured":"A. V. Goldberg, S. A. Plotkin, and \u00c9 Tardos. Combinatorial algorithms for the generalized circulation problem. Mathematics of Operations Research, 16:351\u2013379, 1991.","journal-title":"Mathematics of Operations Research"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"A. V. Goldberg","year":"1988","unstructured":"A. V. Goldberg and R. E. Tarjan. A new approach to the maximum flow problem. Journal of the ACM, 35:921\u2013940, 1988.","journal-title":"Journal of the ACM"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1145\/76359.76368","volume":"36","author":"A. V. Goldberg","year":"1989","unstructured":"A. V. Goldberg and R. E. Tarjan. Finding minimum-cost circulations by canceling negative cycles. Journal of the ACM, 36:388\u2013397, 1989.","journal-title":"Journal of the ACM"},{"key":"24_CR10","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1287\/moor.15.3.430","volume":"15","author":"A. V. Goldberg","year":"1990","unstructured":"A. V. Goldberg and R. E. Tarjan. Solving minimum cost flow problems by successive approximation. Mathematics of Operations Research, 15:430\u2013466, 1990.","journal-title":"Mathematics of Operations Research"},{"key":"24_CR11","unstructured":"D. Goldfarb and Z. Jin. A polynomial dual simplex algorithm for the generalized circulation problem. Technical report, Department of Industrial Engineering and Operations Research, Columbia University, 1995."},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1287\/moor.21.3.529","volume":"21","author":"D. Goldfarb","year":"1996","unstructured":"D. Goldfarb and Z. Jin. A faster combinatorial algorithm for the generalized circulation problem. Mathematics of Operations Research, 21:529\u2013539, 1996.","journal-title":"Mathematics of Operations Research"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"D. Goldfarb, Z. Jin, and J. B. Orlin. Polynomial-time highest gain augmenting path algorithms for the generalized circulation problem. Mathematics of Operations Research. To appear.","DOI":"10.1287\/moor.22.4.793"},{"key":"24_CR14","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1287\/opre.10.4.476","volume":"10","author":"W. S. Jewell","year":"1962","unstructured":"W. S. Jewell. Optimal flow through networks with gains. Operations Research, 10:476\u2013499, 1962.","journal-title":"Operations Research"},{"key":"24_CR15","unstructured":"Anil Kamath and Omri Palmon. Improved interior point algorithms for exact and approximate solution of multicommodity flow problems. In Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 502\u2013511, 1995."},{"key":"24_CR16","unstructured":"S. Kapoor and P. M. Vaidya. Speeding up Karmarkar\u2019s algorithm for multicommodity flows. Math Programming. To appear."},{"issue":"1","key":"24_CR17","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1145\/204865.204889","volume":"38","author":"K. Mehlhorn","year":"1995","unstructured":"K. Mehlhorn and S. N\u00e4her. A platform for combinatorial and geometric computing. CACM, 38(1):96\u2013102, 1995. http:\/\/ftp.mpi-sb.mpg.de\/LEDA\/leda.html","journal-title":"CACM"},{"key":"24_CR18","unstructured":"S. M. Murray. An interior point approach to the generalized flow problem with costs and related problems. PhD thesis, Stanford University, 1993."},{"key":"24_CR19","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1109\/TCT.1966.1082612","volume":"13","author":"K. Onaga","year":"1966","unstructured":"K. Onaga. Dynamic programming of optimum flows in lossy communication nets. IEEE Trans. Circuit Theory, 13:308\u2013327, 1966.","journal-title":"IEEE Trans. Circuit Theory"},{"key":"24_CR20","unstructured":"T. Radzik. Faster algorithms for the generalized network flow problem. Mathematics of Operations Research. To appear."},{"key":"24_CR21","unstructured":"T. Radzik. Approximate generalized circulation. Technical Report 93-2, Cornell Computational Optimization Project, Cornell University, 1993."},{"key":"24_CR22","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1137\/0132037","volume":"32","author":"K. Truemper","year":"1977","unstructured":"K. Truemper. On max flows with gains and pure min-cost flows. SIAM J. Appl. Math, 32:450\u2013456, 1977.","journal-title":"SIAM J. Appl. Math"},{"key":"24_CR23","doi-asserted-by":"crossref","unstructured":"P. Tseng and D. P. Bertsekas. An \u2208-relaxation method for separable convex cost generalized network flow problems. In 5th International Integer Programming and Combinatorial Optimization Conference, 1996.","DOI":"10.1007\/3-540-61310-2_7"}],"container-title":["Integer Programming and Combinatorial Optimization","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-69346-7_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T14:05:58Z","timestamp":1556719558000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-69346-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540645900","9783540693468"],"references-count":23,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-69346-7_24","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"published":{"date-parts":[[1998]]}}}