{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:01:04Z","timestamp":1725534064900},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642022692"},{"type":"electronic","value":"9783642022708"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02270-8_4","type":"book-chapter","created":{"date-parts":[[2009,6,19]],"date-time":"2009-06-19T01:17:47Z","timestamp":1245374267000},"page":"4-15","source":"Crossref","is-referenced-by-count":1,"title":["Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains"],"prefix":"10.1007","author":[{"given":"Franz J.","family":"Brandenburg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mao-cheng","family":"Cai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","volume-title":"Network Flows","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows. Prentice Hall, Englewood Cliffs (1993)"},{"unstructured":"Batagelj, V.: Personal communication (1999)","key":"4_CR2"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/3-540-36379-3_5","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"F.J. Brandenburg","year":"2002","unstructured":"Brandenburg, F.J.: Cycles in generalized networks. In: Ku\u010dera, L. (ed.) WG 2002. LNCS, vol.\u00a02573, pp. 47\u201356. Springer, Heidelberg (2002); Corrigendum In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol. 2880, pp. 47\u201357. Springer, Heidelberg"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s101070050058","volume":"85","author":"B.V. Cherkassky","year":"1999","unstructured":"Cherkassky, B.V., Goldberg, A.V.: Negative-cycle detection algorithms. Math. Program.\u00a085, 277\u2013311 (1999)","journal-title":"Math. Program."},{"unstructured":"Cisco, IP Multicasting, Module 4 Basic Multicast Debugging Cisco Systems Inc. (1998)","key":"4_CR5"},{"key":"4_CR6","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)"},{"key":"4_CR7","doi-asserted-by":"publisher","DOI":"10.1515\/9781400884179","volume-title":"Linear Programming and Extensions","author":"G.B. Dantzig","year":"1963","unstructured":"Dantzig, G.B.: Linear Programming and Extensions. Princeton Univ. Press, Princeton (1963)"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s101070100238","volume":"91","author":"L.K. Fleischer","year":"2002","unstructured":"Fleischer, L.K., Wayne, K.D.: Fast and simple approximation schemes for generalized flow. Math. Program.\u00a091, 215\u2013238 (2002)","journal-title":"Math. Program."},{"key":"4_CR9","volume-title":"Flows in Networks","author":"L.R. Ford Jr.","year":"1962","unstructured":"Ford Jr., L.R., Fulkerson, D.R.: Flows in Networks. Princeton Univ. Press, Princeton (1962)"},{"key":"4_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco (1979)"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1287\/moor.16.2.351","volume":"16","author":"A.V. Goldberg","year":"1991","unstructured":"Goldberg, A.V., Plotkin, S.A., Tardos, E.: Combinatorial algorithms for the generalized circulation problem. Math. Oper. Res.\u00a016, 351\u2013381 (1991)","journal-title":"Math. Oper. Res."},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1287\/moor.22.4.793","volume":"22","author":"D. Goldfarb","year":"1997","unstructured":"Goldfarb, D., Jin, Z., Orlin, J.: Polynomial-time highest-gain augmenting path algorithms for the generalized circulation problem. Math. Oper. Res.\u00a022, 793\u2013802 (1997)","journal-title":"Math. Oper. Res."},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s101070100248","volume":"91","author":"D. Goldfarb","year":"2002","unstructured":"Goldfarb, D., Jin, Z., Lin, Y.: A polynomial dual simplex algorithm for the generalized circulation problem. Math. Progam., Ser. A\u00a091, 271\u2013288 (2002)","journal-title":"Math. Progam., Ser. A"},{"unstructured":"Haider, S.: Passau und der Salzhandel nach \u00d6sterreich. In: Wurster, H.W., Brunner, M., Loibl, R., Brunner, A. (eds.) Weisses Gold: Passau Vom Reichtum einer europ\u00e4ischen Stadt, Katalog zur Ausstellung von Stadt und Dioz\u00f6se Passau im Oberhausmuseum Passau, pp. 221\u2013236 (1995)","key":"4_CR14"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1287\/opre.10.4.476","volume":"10","author":"W.S. Jewell","year":"1962","unstructured":"Jewell, W.S.: Optimal flow through networks with gains. Oper. Res.\u00a010, 476\u2013499 (1962)","journal-title":"Oper. Res."},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0020-0190(91)90246-E","volume":"37","author":"V. Kann","year":"1991","unstructured":"Kann, V.: Maximum bounded 3-dimensional matching is MAX-SNP-complete. Inform. Proc. Letters\u00a037, 27\u201335 (1991)","journal-title":"Inform. Proc. Letters"},{"unstructured":"Kantorovich, L.V.: Mathematical methods of organizing and planning production, Publication House of the Leningrad State University, 68 (1939);","key":"#cr-split#-4_CR17.1"},{"doi-asserted-by":"crossref","unstructured":"Translated in Management Science 6, 366\u2013422 (1960)","key":"#cr-split#-4_CR17.2","DOI":"10.1287\/mnsc.6.4.366"},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar","year":"1984","unstructured":"Karmarkar, N.: A new polynomial-time algorithm for linear programming. Combinatorica\u00a04, 373\u2013395 (1984)","journal-title":"Combinatorica"},{"key":"4_CR19","first-page":"53","volume":"20","author":"L.G. Khachian","year":"1980","unstructured":"Khachian, L.G.: Polynomial algorithms in linear programming. Zhurnal Vychislitelnoi Matematiki i Matematicheskoi Fiziki\u00a020, 53\u201372 (1980)","journal-title":"Zhurnal Vychislitelnoi Matematiki i Matematicheskoi Fiziki"},{"unstructured":"Lawler, E.L.: Combinatorial Optimization: Networks and Matroids, Holt, Rinehard, and Winston, New York (1976)","key":"4_CR20"},{"key":"4_CR21","volume-title":"LEDA: A Platform for Combinatorial and Geometric Computing","author":"K. Mehlhorn","year":"1999","unstructured":"Mehlhorn, K., N\u00e4her, S.: LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, Cambridge (1999)"},{"key":"4_CR22","volume-title":"Economics, Organization, and Management","author":"P. Milgrom","year":"1992","unstructured":"Milgrom, P., Roberts, J.: Economics, Organization, and Management. Prentice-Hall, Englewood Cliffs (1992)"},{"key":"4_CR23","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1006\/jagm.2000.1130","volume":"38","author":"J.D. Oldham","year":"2001","unstructured":"Oldham, J.D.: Combinatorial approximation algorithms for generalized flow problems. J. Algorithms\u00a038, 135\u2013168 (2001)","journal-title":"J. Algorithms"},{"doi-asserted-by":"crossref","unstructured":"Tarjan, R.E.: Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia (1983)","key":"4_CR24","DOI":"10.1137\/1.9781611970265"},{"key":"4_CR25","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1287\/moor.27.3.445.313","volume":"27","author":"K.D. Wayne","year":"2002","unstructured":"Wayne, K.D.: A polynomial combinatorial algorithm for generalized cost flow. Mathematics of Operations Research\u00a027, 445\u2013459 (2002)","journal-title":"Mathematics of Operations Research"},{"unstructured":"http:\/\/wienerboerse.at\/glossary\/1\/19\/446","key":"4_CR26"},{"key":"4_CR27","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1137\/S0097539794266407","volume":"26","author":"D. Zuckerman","year":"1996","unstructured":"Zuckerman, D.: On unapproximable versions of NP-complete problems. SIAM J. Comput.\u00a026, 1293\u20131304 (1996)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02270-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T20:09:24Z","timestamp":1558382964000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02270-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642022692","9783642022708"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02270-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}