{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:19:38Z","timestamp":1759335578260},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1985,6,1]],"date-time":"1985-06-01T00:00:00Z","timestamp":486432000000},"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":[[1985,6]]},"DOI":"10.1007\/bf01586090","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:30:18Z","timestamp":1114677018000},"page":"183-198","source":"Crossref","is-referenced-by-count":21,"title":["Metrics and undirected cuts"],"prefix":"10.1007","volume":"32","author":[{"given":"A. V.","family":"Karzanov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"Flow algorithms","author":"G.M. Adelson-Welsky","year":"1975","unstructured":"G.M. Adelson-Welsky, E.A. Dinic and A.V. Karzanov,Flow algorithms (Nauka, Moscow, 1975), in Russian."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"126","DOI":"10.4153\/CJM-1980-010-0","volume":"32","author":"D. Avis","year":"1980","unstructured":"D. Avis, \u201cOn the extreme rays of the metric cone\u201d,Canadian Journal of Mathematics 32 (1980) 126\u2013144.","journal-title":"Canadian Journal of Mathematics"},{"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 University Press, Princeton, NJ, 1962)."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Grotschel","year":"1981","unstructured":"M. Grotschel, L. Lov\u00e1sz and A. Schrijver, \u201cThe ellipsoid method and its consequences in combinatorial optimization\u201d,Combinatorica 1 (1981) 169\u2013197.","journal-title":"Combinatorica"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1287\/opre.11.3.344","volume":"11","author":"T.C. Hu","year":"1963","unstructured":"T.C. Hu, \u201cMulticommodity network flows\u201d,Operations Research 11 (1963) 344\u2013360.","journal-title":"Operations Research"},{"key":"CR6","first-page":"129","volume":"13","author":"M. Iri","year":"1970\/71","unstructured":"M. Iri, On an extension of the maximum-flow minimum-cut theorem to multicommodity flows\u201d,Journal of the Operations Research Society of Japan 13 (1970\/71) 129\u2013135.","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of computer computations","author":"R.M. Karp","year":"1972","unstructured":"R.M. Karp, \u201cReducibility among combinatorial problems, in: R.E. Miller and J.W. Thatcher, eds.,Complexity of computer computations (Plenum Press, New York, 1972) pp. 85\u2013103."},{"key":"CR8","first-page":"6","volume-title":"Combinatorial methods for flow problems","author":"A.V. Karzanov","year":"1979","unstructured":"A.V. Karzanov, \u201cCombinatorial methods for solving cut-determined multi-flow problems\u201d, in: A.V. Karzanov, ed.,Combinatorial methods for flow problems (Institute for System Studies, Moscow, 1979, issue 3) pp. 6\u201369 (in Russian)."},{"key":"CR9","first-page":"443","volume-title":"Finite and infinite sets, Proceedings of the 6th Hungarian Combinatorial Colloquium, Eger 1981","author":"A.V. Karzanov","year":"1984","unstructured":"A.V. Karzanov, \u201cA generalized MFMC-property and multicommodity cut problems, in: A. Hajnal, L. Lov\u00e1sz and V.T. S\u00f3s, eds.,Finite and infinite sets, Proceedings of the 6th Hungarian Combinatorial Colloquium, Eger 1981 (North-Holland, Amsterdam, 1984), v. 2, pp. 443\u2013486."},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"O. Kenji and K. Osamu, \u201cOn feasibility conditions on multicommodity flows in networks\u201d,IEEE Transactions on Circuit Theory CT-18 (1971) 425\u2013429.","DOI":"10.1109\/TCT.1971.1083312"},{"key":"CR11","first-page":"4","volume":"9","author":"M.V. Lomonosov","year":"1979","unstructured":"M.V. Lomonosov, \u201cMultiflow feasibility depending on cuts\u201d,Graph Theory Newsletter 9 (1979) 4.","journal-title":"Graph Theory Newsletter"},{"key":"CR12","first-page":"60","volume":"14","author":"M.V. Lomonosov","year":"1978","unstructured":"M.V. Lomonosov, \u201cOn a system of flows in a network\u201d,Problemy Peredatci Informacii 14 (1978) 60\u201373, in Russian.","journal-title":"Problemy Peredatci Informacii"},{"key":"CR13","first-page":"230","volume-title":"Studies on discrete optimizations","author":"B.A. Papernov","year":"1976","unstructured":"B.A. Papernov, \u201cOn existence of multicommodity flows\u201d, in: A.A. Fridman ed.,Studies on discrete optimizations (Nauka, Moscow, 1976) pp. 230\u2013261 (in Russian)."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1287\/opre.14.3.377","volume":"14","author":"B. Rothschild","year":"1966","unstructured":"B. Rothschild and A. Whinston, \u201cOn two-commodity network flows\u201d,Operations Research 14 (1966) 377\u2013387.","journal-title":"Operations Research"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1002\/net.3230100108","volume":"10","author":"P.D. Seymour","year":"1980","unstructured":"P.D. Seymour, \u201cFour-terminus flows\u201d,Networks 10 (1980) 79\u201386.","journal-title":"Networks"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0012-365X(78)90116-4","volume":"23","author":"P.D. Seymour","year":"1978","unstructured":"P.D. Seymour, \u201cA two-commodity cut theorem\u201d,Discrete Mathematics 23 (1978) 177\u2013181.","journal-title":"Discrete Mathematics"},{"key":"CR17","first-page":"341","volume-title":"Graph theory and related topics","author":"P.D. Seymour","year":"1978","unstructured":"P.D. Seymour, \u201cSums of circuits\u201d, in: J.A. Bondy and U.S.R. Murty, eds.,Graph theory and related topics (Academic Press, New York, 1978) pp. 341\u2013355."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01586090.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01586090\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01586090","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T03:46:07Z","timestamp":1586231167000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01586090"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,6]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,6]]}},"alternative-id":["BF01586090"],"URL":"https:\/\/doi.org\/10.1007\/bf01586090","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,6]]}}}