{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,22]],"date-time":"2024-06-22T09:17:23Z","timestamp":1719047843346},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1997,8,1]],"date-time":"1997-08-01T00:00:00Z","timestamp":870393600000},"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":[[1997,8]]},"DOI":"10.1007\/bf02614372","type":"journal-article","created":{"date-parts":[[2007,4,28]],"date-time":"2007-04-28T04:34:50Z","timestamp":1177734890000},"page":"219-242","source":"Crossref","is-referenced-by-count":5,"title":["Multiflows and disjoint paths of minimum total cost"],"prefix":"10.1007","volume":"78","author":[{"given":"Alexander V.","family":"Karzanov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02614372_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, New York, NY, 1993)."},{"key":"BF02614372_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01586039","volume":"54","author":"R.G. Bland","year":"1992","unstructured":"R.G. Bland and D.L. Jensen, On the computational behavior of a polynomial-time network flow algorithm,Mathematical Programming 54 (1992) 1\u201341.","journal-title":"Mathematical Programming"},{"key":"BF02614372_CR3","unstructured":"M. Burlet and A.V. Karzanov, Minimum weight (T, d)-joins and multi-joins, Research Report RR 929-M- (IMAG ARTEMIS, Grenoble, 1993) 15 p.; to appear inDiscrete Mathematics (1997)."},{"issue":"1","key":"BF02614372_CR4","first-page":"143","volume":"13","author":"B.V. Cherkassky","year":"1977","unstructured":"B.V. Cherkassky, A solution of a problem on multicommodity flows in a network,Ekonomika i Matematicheskie Metody 13 (1) (1977) 143\u2013151 (in Russian).","journal-title":"Ekonomika i Matematicheskie Metody"},{"key":"BF02614372_CR5","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1007\/BF02592027","volume":"36","author":"W. Cunningham","year":"1986","unstructured":"W. Cunningham and J. Green-Krotki, Dominants and submissives of matching polyhedra,Mathematical Programming 36 (1986) 228\u2013237.","journal-title":"Mathematical Programming"},{"key":"BF02614372_CR6","volume-title":"Studies in Discrete Mathematics","author":"E.A. Dinitz","year":"1973","unstructured":"E.A. Dinitz, A method for scaled canceling discrepancies and transportation problems, in: A.A. Fridman, ed.,Studies in Discrete Mathematics (Nauka, Moscow, 1973), in Russian."},{"issue":"1","key":"BF02614372_CR7","first-page":"373","volume":"13","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds, The Chinese postman problem,Oper. Research 13 (Suppl. 1) (1965) 373.","journal-title":"Oper. Research"},{"key":"BF02614372_CR8","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds, Maximum matching and polyhedra with (0,1) vertices,J. Res. Nat. Bur. Standards Sect. B 69 (1965) 125\u2013130.","journal-title":"J. Res. Nat. Bur. Standards Sect. B"},{"key":"BF02614372_CR9","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/BF01580113","volume":"5","author":"J. Edmonds","year":"1973","unstructured":"J. Edmonds and E.L. Johnson, Matchings, Euler tours and Chinese postman,Mathematical Programming 5 (1973) 88\u2013124.","journal-title":"Mathematical Programming"},{"key":"BF02614372_CR10","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S. Even","year":"1976","unstructured":"S. Even, A. Itai and A. Shamir, On the complexity of timetable and multicommodity flow problem,SIAM J. Computing 5 (1976) 691\u2013703.","journal-title":"SIAM J. Computing"},{"key":"BF02614372_CR11","first-page":"248","volume":"19","author":"J. Edmonds","year":"1972","unstructured":"J. Edmonds and R.M. Karp, Theoretical improvements in algorithmic efficiency for network flow problems,J. ASM 19 (1972) 248\u2013264.","journal-title":"J. ASM"},{"key":"BF02614372_CR12","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":"BF02614372_CR13","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1287\/moor.22.1.90","volume":"22","author":"A.V. Goldberg","year":"1997","unstructured":"A.V. Goldberg and A.V. Karzanov, Scaling methods for finding a maximum free multiflow of minimum cost,Mathematics of Operations Research 22 (1997) 90\u2013109.","journal-title":"Mathematics of Operations Research"},{"key":"BF02614372_CR14","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, Network flow algorithms, in: B. Korte, L. Lov\u00e1sz, H.J. Pr\u00f6mel and A. Schrijver, eds.,Paths, Flows, and VLSI-Layout (Springer, Berlin, 1990) 101\u2013164."},{"key":"BF02614372_CR15","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":"BF02614372_CR16","first-page":"273","volume":"1","author":"M. Guan","year":"1962","unstructured":"M. Guan, Graphic programming using odd or even points,Chinese Mathematics 1 (1962) 273\u2013277.","journal-title":"Chinese Mathematics"},{"key":"BF02614372_CR17","first-page":"344","volume":"11","author":"T.C. Hu","year":"1963","unstructured":"T.C. Hu, Multi-commodity network flows,J. ORSA 11 (1963) 344\u2013360.","journal-title":"J. ORSA"},{"key":"BF02614372_CR18","first-page":"96","volume-title":"Combinatorial Methods for Flow Problems","author":"A.V. Karzanov","year":"1979","unstructured":"A.V. Karzanov, Fast algorithms for solving two known undirected multicommodity flow problems, in:Combinatorial Methods for Flow Problems (Institute for System Studies, Moscow, 1979, issue 3) 96\u2013103 (in Russian)."},{"key":"BF02614372_CR19","first-page":"138","volume-title":"Combinatorial Methods for Flow Problems","author":"A.V. Karzanov","year":"1979","unstructured":"A.V. Karzanov, A minimum cost maximum multiflow problem, in:Combinatorial Methods for Flow Problems (Institute for System Studies, Moscow, 1979, issue 3) 138\u2013156 (in Russian)."},{"key":"BF02614372_CR20","first-page":"123","volume-title":"Problems of Discrete Optimization and Methods to Solve Them","author":"A.V. Karzanov","year":"1987","unstructured":"A.V. Karzanov, Unbounded fractionality of maximum-value and minimum-cost maximum-value multiflow problems, in: A.A. Fridman, ed.,Problems of Discrete Optimization and Methods to Solve Them (Central Economical and Mathematical Inst., Moscow, 1987) 123\u2013135 (in Russian); English translation:Amer. Math. Soc. Translations 2 158 (1994) 71\u201380."},{"key":"BF02614372_CR21","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/BF01581152","volume":"66","author":"A.V. Karzanov","year":"1994","unstructured":"A.V. Karzanov, Minimum cost multiflows in undirected networks,Mathematical Programming 66 (1994) 313\u2013325.","journal-title":"Mathematical Programming"},{"key":"BF02614372_CR22","series-title":"Technical Report No. STAN","volume-title":"Edge-disjoint T-paths of minimum total cost","author":"A.V. Karzanov","year":"1993","unstructured":"A.V. Karzanov, Edge-disjoint T-paths of minimum total cost, Technical Report No. STAN -CS-92-1465 (Stanford University, Stanford, CA, 1993) 66 pp."},{"key":"BF02614372_CR23","unstructured":"A.V. Karzanov, Openly disjoint T-paths of minimum total cost, in preparation."},{"key":"BF02614372_CR24","unstructured":"A.K. Kelmans and M.V. Lomonosov, On the maximum number of disjoint chains connecting given terminals in a graph, Abstract,San Francisco Annual Meeting of the AMS (1981) 7\u201311."},{"key":"BF02614372_CR25","first-page":"53","volume":"20","author":"L.G. Khachiyan","year":"1980","unstructured":"L.G. Khachiyan, Polynomial algorithms in linear programming,Zhurnal Vychislitelnoj Matematiki i Matematicheskoi Fiziki 20 (1980) 53\u201372 (in Russian).","journal-title":"Zhurnal Vychislitelnoj Matematiki i Matematicheskoi Fiziki"},{"key":"BF02614372_CR26","unstructured":"V.L. Kupershtokh, On a generalization of Ford-Fulkerson\u2019s theorem to multi-terminal networks,Kibernetika 5 (1971) (in Russian)."},{"key":"BF02614372_CR27","unstructured":"M.V. Lomonosov, On packing chains in a multigraph, Unpublished manuscript, 1977, 20 pp."},{"key":"BF02614372_CR28","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF01902503","volume":"28","author":"L. Lov\u00e1sz","year":"1976","unstructured":"L. Lov\u00e1sz, On some connectivity properties of Eulerian graphs,Acta Math. Acad. Sci. Hungar. 28 (1976) 129\u2013138.","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"BF02614372_CR29","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/0095-8956(80)90066-0","volume":"28","author":"L. Lov\u00e1sz","year":"1980","unstructured":"L. Lov\u00e1sz, Matroid matching and some applications,J. Combinatorial Theory Series B 28 (1980) 208\u2013236.","journal-title":"J. Combinatorial Theory Series B"},{"key":"BF02614372_CR30","volume-title":"Matching Theory","author":"L. Lov\u00e1sz","year":"1986","unstructured":"L. Lov\u00e1sz and M.D. Plummer,Matching Theory (Akad\u00e9miai Kiad\u00f3, Budapest, 1986)."},{"key":"BF02614372_CR31","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF01226062","volume":"30","author":"W. Mader","year":"1978","unstructured":"W. Mader, \u00dcber die Maximalzahl kantendisjunkter A-Wege,Arch. Math. 30 (1978) 325\u2013336.","journal-title":"Arch. Math."},{"key":"BF02614372_CR32","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF01226465","volume":"31","author":"W. Mader","year":"1978","unstructured":"W. Mader, \u00dcber die Maximalzahl kreuzungsfreier H-Wege,Arch. Math. 31 (1978) 387\u2013402.","journal-title":"Arch. Math."},{"key":"BF02614372_CR33","first-page":"181","volume-title":"Discrete Structures and Algorithms","author":"H. R\u00f6ck","year":"1980","unstructured":"H. R\u00f6ck, Scaling techniques for minimal cost network flows, in: U. Pape, ed.,Discrete Structures and Algorithms (Carl Hansen, Munich, 1980) 181\u2013191."},{"key":"BF02614372_CR34","doi-asserted-by":"crossref","first-page":"1121","DOI":"10.1287\/opre.14.6.1121","volume":"14","author":"B. Rothschild","year":"1966","unstructured":"B. Rothschild and A. Whinston, Feasibility of two-commodity network flows,Operations Research 14 (1966) 1121\u20131129.","journal-title":"Operations Research"},{"key":"BF02614372_CR35","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1287\/opre.34.2.250","volume":"34","author":"E. Tardos","year":"1986","unstructured":"E. Tardos, A strongly polynomial algorithm to solve combinatorial linear programs,Operations 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\/BF02614372.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02614372\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02614372","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T08:49:24Z","timestamp":1558342164000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02614372"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,8]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,8]]}},"alternative-id":["BF02614372"],"URL":"https:\/\/doi.org\/10.1007\/bf02614372","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,8]]}}}