{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T05:56:40Z","timestamp":1715061400579},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1994,8,1]],"date-time":"1994-08-01T00:00:00Z","timestamp":775699200000},"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,8]]},"DOI":"10.1007\/bf01581152","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T05:41:12Z","timestamp":1114666872000},"page":"313-325","source":"Crossref","is-referenced-by-count":13,"title":["Minimum cost multiflows in undirected networks"],"prefix":"10.1007","volume":"66","author":[{"given":"A. V.","family":"Karzanov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"CR1","first-page":"143","volume":"13","author":"B.V. Cherkassky","year":"1977","unstructured":"B.V. Cherkassky, \u201cA solution of a problem on multicommodity flows in a network,\u201dEkonomika i Matematicheskie Metody 13 (1) (1977) 143\u2013151 (Russian).","journal-title":"Ekonomika i Matematicheskie Metody"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0167-5060(08)70734-9","volume":"1","author":"J. Edmonds","year":"1977","unstructured":"J. Edmonds and R. Giles, \u201cA min\u2014max relation for submodular functions on directed graphs,\u201d in: P.L. Hammer, E.L. Johnson, and B.H. Korte, eds.,Studies in Integer Programming (Annals of Discrete Mathematics, v. 1, 1977) 185\u2013204.","journal-title":"Studies in Integer Programming"},{"key":"CR3","volume-title":"Flows in Networks","author":"L.R. Ford","year":"1962","unstructured":"L.R. Ford and D.R. Fulkerson,Flows in Networks (Princeton Univ. Press, Princeton, NJ, 1962)."},{"key":"CR4","first-page":"101","volume-title":"Paths, Flows, and VLSI-Layout","author":"A.V. Goldberg","year":"1990","unstructured":"A.V. Goldberg, E. Tardos, and R.E. Tarjan, \u201cNetwork flow algorithms,\u201d in: B. Korte, L. Lov\u00e1sz, H.J. Pr\u00f6mel, and A. Schrijver, eds.,Paths, Flows, and VLSI-Layout (Springer, Berlin et al., 1990) pp. 101\u2013164."},{"issue":"4","key":"CR5","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1145\/76359.76368","volume":"36","author":"A.V. Goldberg","year":"1989","unstructured":"A.V. Goldberg and R. Tarjan, \u201cFinding minimum-cost circulations by canceling negative cycles,\u201dJournal of the ACM 36 (4) (1989) 873\u2013886.","journal-title":"Journal of the ACM"},{"key":"CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tshel","year":"1988","unstructured":"M. Gr\u00f6tshel, L. Lov\u00e1sz, and A. Schrijver,Geometric Algorithms and Combinatorial Optimization (Springer, Berlin, 1988)."},{"key":"CR7","first-page":"138","volume-title":"Combinatorial Methods for Flow Problems","author":"A.V. Karzanov","year":"1979","unstructured":"A.V. Karzanov, \u201cA minimum cost maximum multiflow problem,\u201d in:Combinatorial Methods for Flow Problems (Institute for System Studies, Moscow, 1979, issue 3) pp. 138\u2013156 (Russian)."},{"key":"CR8","first-page":"96","volume-title":"Combinatorial Methods for Flow Problems","author":"A.V. Karzanov","year":"1979","unstructured":"A.V. Karzanov, \u201cFast algorithms for solving two known undirected multicommodity flow problems,\u201d in:Combinatorial Methods for Flow Problems (Institute for System Studies, Moscow, 1979, issue 3) pp. 96\u2013103 (Russian)."},{"key":"CR9","first-page":"123","volume-title":"Problems of Discrete Optimization and Methods to Solve Them","author":"A.V. Karzanov","year":"1987","unstructured":"A.V. Karzanov, \u201cUnbounded fractionality in maximum-value and minimum-cost maximum-value multiflow problems,\u201d in: A.A. Fridman, ed.,Problems of Discrete Optimization and Methods to Solve Them (Central Economical and Mathematical Inst., Moscow, 1987) pp. 123\u2013135 (Russian)."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1016\/0024-3795(89)90468-0","volume":"114\/115","author":"A.V. Karzanov","year":"1989","unstructured":"A.V. Karzanov, \u201cPolyhedra related to undirected multicommodity flows,\u201dLinear Algebra and Its Applications 114\/115 (1989) 294\u2013328. (English translation in:American Mathematical Society Translations, Ser. 2, 158 (1994) 71\u201380.)","journal-title":"Linear Algebra and Its Applications"},{"key":"CR11","first-page":"53","volume":"20","author":"L.G. Khachiyan","year":"1980","unstructured":"L.G. Khachiyan, \u201cPolynomial algorithms in linear programming,\u201dZhurnal Vychislitelnoj Matematiki i Matematicheskoi Fiziki 20 (1980) 53\u201372 (Russian).","journal-title":"Zhurnal Vychislitelnoj Matematiki i Matematicheskoi Fiziki"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF01902503","volume":"28","author":"L. Lov\u00e1sz","year":"1976","unstructured":"L. Lov\u00e1sz, \u201cOn some connectivity properties of Eulerian graphs,\u201dActa Mathematica Academiae Scientiarum Hungaricae 28 (1976) 129\u2013138.","journal-title":"Acta Mathematica Academiae Scientiarum Hungaricae"},{"issue":"3","key":"CR13","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF02579369","volume":"5","author":"E. Tardos","year":"1985","unstructured":"E. Tardos, \u201cA strongly polynomial minimum cost circulation algorithm,\u201dCombinatorica 5 (3) (1985) 247\u2013255.","journal-title":"Combinatorica"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1287\/opre.34.2.250","volume":"34","author":"E. Tardos","year":"1986","unstructured":"E. Tardos, \u201cA strongly polynomial algorithm to solve combinatorial linear programs,\u201dOperations Research 34 (1986) 250\u2013256.","journal-title":"Operations Research"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581152.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01581152\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581152","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:12:15Z","timestamp":1556881935000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01581152"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,8]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,8]]}},"alternative-id":["BF01581152"],"URL":"https:\/\/doi.org\/10.1007\/bf01581152","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,8]]}}}