{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T21:40:38Z","timestamp":1784238038501,"version":"3.55.0"},"reference-count":86,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1988,4,1]],"date-time":"1988-04-01T00:00:00Z","timestamp":575856000000},"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":[[1988,4]]},"DOI":"10.1007\/bf01589418","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:09:36Z","timestamp":1114679376000},"page":"489-563","source":"Crossref","is-referenced-by-count":109,"title":["Generalized polymatroids and submodular flows"],"prefix":"10.1007","volume":"42","author":[{"given":"Andr\u00e1s","family":"Frank","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"\u00c9va","family":"Tardos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"\u201cA linear characterization of permutation vectors,\u201d Management Science Research Report No. 364","author":"E. Balas","year":"1975","unstructured":"E. Balas, \u201cA linear characterization of permutation vectors,\u201d Management Science Research Report No. 364, Carnegie-Mellon University, Pittsburgh, PA (1975)."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1002\/net.3230130405","volume":"13","author":"E. Balas","year":"1983","unstructured":"E. Balas and W. Pulleyblank, \u201cThe perfectly matchable subgraph polytope of bipartite graphs,\u201dNetworks 13 (1983) 495\u2013516.","journal-title":"Networks"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1287\/moor.10.3.367","volume":"10","author":"R.E. Bixby","year":"1985","unstructured":"R.E. Bixby, W.H. Cunningham and D.M. Topkis, \u201cThe partial order of a polymatroid extreme point,\u201dMathematics of Operations Research 10 (1985) 367\u2013378.","journal-title":"Mathematics of Operations Research"},{"key":"CR4","first-page":"37","volume":"23","author":"O. Boruvka","year":"1926","unstructured":"O. Boruvka, \u201cO jist\u00e9m probl\u00e9mu minim\u00e1lnim\u201c (with extended abstract in German),Acte Societatis Scientiarium Naturalium Moravicae, Tomus III, Fasc. 3, Signature F23 (1926) 37\u201358.","journal-title":"Acte Societatis Scientiarium Naturalium Moravicae, Tomus III, Fasc. 3, Signature F"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1002\/jgt.3190070213","volume":"7","author":"Cai Mao-Cheng","year":"1983","unstructured":"Cai Mao-Cheng, \u201cArc-disjoint arborescences of diagraphs,\u201dJournal of Graph Theory 7 (1983) 235\u2013240.","journal-title":"Journal of Graph Theory"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/BF01582162","volume":"34","author":"W. Cook","year":"1986","unstructured":"W. Cook, \u201cOn box totally dual integral polyhedra,\u201dMathematical Programming 34 (1986) 48\u201361.","journal-title":"Mathematical Programming"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0024-3795(77)90003-9","volume":"16","author":"W.H. Cunningham","year":"1977","unstructured":"W.H. Cunningham, \u201cAn unbounded matroid intersection polyhedron,\u201dLinear Algebra and its Applications 16 (1977) 209\u2013215.","journal-title":"Linear Algebra and its Applications"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/3828.3829","volume":"32","author":"W.H. Cunningham","year":"1985","unstructured":"W.H. Cunningham, \u201cOptimal attack and reinforcement of a network,\u201dJournal of the Association for Computing Machinery 32 (1985) 549\u2013561.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/BF02579361","volume":"5","author":"W.H. Cunningham","year":"1985","unstructured":"W.H. Cunningham, \u201cOn submodular function minimization,\u201dCombinatorica 5 (1985) 185\u2013192.","journal-title":"Combinatorica"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1287\/moor.10.2.251","volume":"10","author":"W.H. Cunningham","year":"1985","unstructured":"W.H. Cunningham and A. Frank, \u201cA primal-dual algorithm for submodular flows,\u201dMathematics of Operations Research 10 (1985) 251\u2013262.","journal-title":"Mathematics of Operations Research"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1093\/qmath\/27.3.339","volume":"27","author":"F.D.J. Dunstan","year":"1976","unstructured":"F.D.J. Dunstan, \u201cMatroids and submodular functions,\u201dQuarterly Journal of Mathematics Oxford 27 (1976) 339\u2013347.","journal-title":"Quarterly Journal of Mathematics Oxford"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"67","DOI":"10.6028\/jres.069B.004","volume":"69","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds, \u201cMinimum partition of a matroid into independent sets,\u201dJournal of Research of the National Bureau of Standards Section B 69 (1965) 67\u201372.","journal-title":"Journal of Research of the National Bureau of Standards Section B"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"73","DOI":"10.6028\/jres.069B.005","volume":"69","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds, \u201cLehman's switching game and a theorem of Tutte and Nash-Williams,\u201dJournal of Research of the National Bureau of Standards Section B 69 (1965) 73\u201377.","journal-title":"Journal of Research of the National Bureau of Standards Section B"},{"key":"CR14","first-page":"69","volume-title":"Combinatorial Structures and their Applications","author":"J. Edmonds","year":"1970","unstructured":"J. Edmonds, \u201cSubmodular functions, matroids, and certain polyhedra,\u201d in: R. Guy, H. Hanani, N. Sauer and J. Schonheim, eds.,Combinatorial Structures and their Applications (Gordon and Breach, New York 1970) pp. 69\u201387."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01584082","volume":"1","author":"J. Edmonds","year":"1971","unstructured":"J. Edmonds, \u201cMatroids and the greedy algorithm,\u201dMathematical Programming 1 (1971) 127\u2013136.","journal-title":"Mathematical Programming"},{"key":"CR16","first-page":"91","volume-title":"Combinatorial Algorithms","author":"J. Edmonds","year":"1973","unstructured":"J. Edmonds, \u201cEdge-disjoint branchings,\u201d in: R. Rustin, ed.,Combinatorial Algorithms (Algorithmic Press, New York, 1973) pp. 91\u201396."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0167-5060(08)70817-3","volume":"4","author":"J. Edmonds","year":"1979","unstructured":"J. Edmonds, \u201cMatroid intersection,\u201dAnnals of Discrete Mathematics 4 (1979) 39\u201349.","journal-title":"Annals of Discrete Mathematics"},{"key":"CR18","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-max relation for submodular functions on graphs,\u201dAnnals of Discrete Mathematics 1 (1977) 185\u2013204.","journal-title":"Annals of Discrete Mathematics"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0012-365X(83)90038-9","volume":"45","author":"J. Fonlupt","year":"1983","unstructured":"J. Fonlupt and A. Zemirline, \u201cOn the number of common bases of two matroids,\u201dDiscrete Mathematics 45 (1983) 217\u2013228.","journal-title":"Discrete Mathematics"},{"key":"CR20","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":"CR21","first-page":"63","volume":"41","author":"A. Frank","year":"1979","unstructured":"A. Frank, \u201cKernel systems of directed graphs,\u201dActa Universities Szegediensis 41 (1979) 63\u201376.","journal-title":"Acta Universities Szegediensis"},{"key":"CR22","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0095-8956(80)90071-4","volume":"28","author":"A. Frank","year":"1980","unstructured":"A. Frank, \u201cOn the orientation of graphs,\u201dJournal of Combinatorial Theory B 28 (1980) 251\u2013261.","journal-title":"Journal of Combinatorial Theory B"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF02579270","volume":"1","author":"A. Frank","year":"1981","unstructured":"A. Frank, \u201cHow to make a digraph strongly connected,\u201dCombinatorica 1 (1981) 145\u2013153.","journal-title":"Combinatorica"},{"key":"CR24","first-page":"159","volume-title":"Algebraic Methods in Graph Theory","author":"A. Frank","year":"1981","unstructured":"A. Frank, \u201cOn disjoint trees and arborescences,\u201d in: L. Lov\u00e1sz and V.T. S\u00f3s, eds.,Algebraic Methods in Graph Theory (North-Holland, Amsterdam-New York, 1981) pp. 159\u2013170."},{"key":"CR25","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/0196-6774(81)90032-8","volume":"2","author":"A. Frank","year":"1981","unstructured":"A. Frank, \u201cA weighted matroid intersection algorithm,\u201dJournal of Algorithms 2 (1981) 328\u2013336.","journal-title":"Journal of Algorithms"},{"key":"CR26","first-page":"97","volume-title":"Bonn Workshop on Combinatorial Optimization, Bonn 1980, North-Holland Mathematics Studies 66","author":"A. Frank","year":"1982","unstructured":"A. Frank, \u201cAn algorithm for submodular functions on graphs,\u201d in: A. Bachem, M. Gr\u00f6tschel and B. Korte, eds., Bonn Workshop on Combinatorial Optimization, Bonn 1980, North-Holland Mathematics Studies 66 (North-Holland, Amsterdam-New York, 1982) pp. 97\u2013120."},{"key":"CR27","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0095-8956(84)90029-7","volume":"36","author":"A. Frank","year":"1984","unstructured":"A. Frank, \u201cFinding feasible vectors of Edmonds-Giles polyhedra,\u201dJournal of Combinatorial Theory B 36 (1984) pp. 221\u2013239.","journal-title":"Journal of Combinatorial Theory B"},{"key":"CR28","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/B978-0-12-566780-7.50015-5","volume-title":"Progress in Combinatorial Optimization","author":"A. Frank","year":"1984","unstructured":"A. Frank, \u201cSubmodular flows,\u201d in: W.R. Pulleyblank, ed.,Progress in Combinatorial Optimization (Academic Press, Toronto, Ontario, 1984) pp. 147\u2013166."},{"key":"CR29","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/B978-0-444-86893-0.50021-8","volume-title":"Finite and Infinite Sets","author":"A. Frank","year":"1984","unstructured":"A. Frank, \u201cGeneralized polymatroids,\u201d in: A. Hajnal et. al., eds.,Finite and Infinite Sets (North-Holland, Amsterdam-New York, 1984) pp. 285\u2013294."},{"key":"CR30","first-page":"353","volume-title":"Combinatorics","author":"A. Frank","year":"1978","unstructured":"A. Frank and A. Gy\u00e1rf\u00e1s, \u201cHow to orient the edges of a graph,\u201d in: A. Hajnal and V.T. S\u00f3s, eds.,Combinatorics (North-Holland, Amsterdam-New York, 1978) pp. 353\u2013363."},{"key":"CR31","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/B978-0-444-86893-0.50022-X","volume-title":"Finite and Infinite Sets","author":"A. Frank","year":"1984","unstructured":"A. Frank and \u00c9. Tardos, \u201cMatroids from crossing families,\u201d in: A. Hajnal et. al., eds.,Finite and Infinite Sets (North-Holland, Amsterdam-New York, 1984) pp. 295\u2013304."},{"key":"CR32","first-page":"129","volume-title":"Algebraic and Combinatorial Methods in Operations Research, North-Holland Mathematics Studies 95,Annals of Discrete Mathematics 19","author":"A. Frank","year":"1984","unstructured":"A. Frank and \u00c9. Tardos, \u201cAn algorithm for the unbounded matroid intersection polyhedron,\u201d in: R.E. Burkard, R.A. Cunninghame-Green and U. Zimmermann, eds.,Algebraic and Combinatorial Methods in Operations Research, North-Holland Mathematics Studies 95,Annals of Discrete Mathematics 19 (North-Holland, Amsterdam-New York, 1984) pp. 129\u2013134."},{"key":"CR33","unstructured":"A. Frank and \u00c9. Tardos, \u201cAn application of submodular flows,\u201d to appear inLinear Algebra and its Applications."},{"key":"CR34","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BFb0121011","volume":"22","author":"A. Frank","year":"1984","unstructured":"A. Frank, A. Seb\u00f6 and \u00c9. Tardos, \u201cCovering directed and odd cuts,\u201dMathematical Programming Studies 22 (1984) 99\u2013112.","journal-title":"Mathematical Programming Studies"},{"key":"CR35","doi-asserted-by":"crossref","first-page":"189","DOI":"10.15807\/jorsj.21.189","volume":"21","author":"S. Fujishige","year":"1978","unstructured":"S. Fujishige, \u201cAlgorithms for solving the independent flow problems,\u201dJournal of the Operations Research Society of Japan 21 (1978) 189\u2013203.","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"CR36","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF02592217","volume":"29","author":"S. Fujishige","year":"1984","unstructured":"S. Fujishige, \u201cStructures of polyhedra determined by submodular functions on crossing families,\u201dMathematical Programming 29 (1984) 125\u2013141.","journal-title":"Mathematical Programming"},{"key":"CR37","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0166-218X(84)90117-3","volume":"7","author":"S. Fujishige","year":"1984","unstructured":"S. Fujishige, \u201cA note on Frank's generalized polymatroids,\u201dDiscrete Applied Mathematics 7 (1984) 105\u2013109.","journal-title":"Discrete Applied Mathematics"},{"key":"CR38","doi-asserted-by":"crossref","first-page":"112","DOI":"10.15807\/jorsj.27.112","volume":"27","author":"S. Fujishige","year":"1984","unstructured":"S. Fujishige, \u201cA characterization of faces of the base polyhedron associated with a submodular system,\u201dJournal of the Operations Research Society of Japan 27 (1984) 112\u2013128.","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"CR39","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BFb0121012","volume":"22","author":"S. Fujishige","year":"1984","unstructured":"S. Fujishige, \u201cSubmodular systems and related topics,\u201d in B. Korte and K. Ritter, eds.,Mathematical Programming Study 22 (1984) 113\u2013131.","journal-title":"Mathematical Programming Study"},{"key":"CR40","doi-asserted-by":"crossref","first-page":"309","DOI":"10.15807\/jorsj.26.309","volume":"26","author":"S. Fujishige","year":"1983","unstructured":"S. Fujishige and N. Tomizawa, \u201cA note on submodular functions on distributive lattices,\u201dJournal of the Operations Research Society of Japan 26 (1983) 309\u2013318.","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"CR41","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/S0021-9800(68)80039-0","volume":"4","author":"D. Gale","year":"1968","unstructured":"D. Gale, \u201cOptimal assignments in an ordered set: An application of matroid theory,\u201dJournal of Combinatorial Theory 4 (1968) 176\u2013190.","journal-title":"Journal of Combinatorial Theory"},{"key":"CR42","volume-title":"Submodular functions, graphs and integer polyhedra","author":"R. Giles","year":"1975","unstructured":"R. Giles, \u201cSubmodular functions, graphs and integer polyhedra,\u201d Ph.D. Thesis, Department of Combinatorics and Optimization, University of Waterloo, Canada, 1975."},{"key":"CR43","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF02579175","volume":"1","author":"H. Gr\u00f6flin","year":"1981","unstructured":"H. Gr\u00f6flin and A.J. Hoffman, \u201cOn matroid intersections,\u201dCombinatorica 1 (1981) 43\u201347.","journal-title":"Combinatorica"},{"key":"CR44","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF01589348","volume":"20","author":"H. Gr\u00f6flin","year":"1981","unstructured":"H. Gr\u00f6flin and T.M. Liebling, \u201cConnected and alternating vectors, polyhedra and algorithms,\u201dMathematical Programming 20 (1981) 233\u2013244.","journal-title":"Mathematical Programming"},{"key":"CR45","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz and A. Schrijver, \u201cThe ellipsoid method and its consequences in combinatorial optimization,\u201dCombinatorica 1 (1981) 169\u2013187.","journal-title":"Combinatorica"},{"key":"CR46","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230120102","volume":"12","author":"R. Hassin","year":"1982","unstructured":"R. Hassin, \u201cMinimum cost flow with set-constraints,\u201dNetworks 12 (1982) 1\u201322.","journal-title":"Networks"},{"key":"CR47","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0021-9800(68)80054-7","volume":"5","author":"D.A. Higgs","year":"1968","unstructured":"D.A. Higgs, \u201cStrong maps of geometries,\u201dJournal of Combinatorial Theory 5 (1968) 185\u2013191.","journal-title":"Journal of Combinatorial Theory"},{"key":"CR48","first-page":"113","volume-title":"Proceedings of the Symposium of Applied Mathematics 10","author":"A. Hoffman","year":"1960","unstructured":"A. Hoffman, \u201cSome recent applications of the theory of linear inequalities to extremal combinatorial analysis,\u201d in:Proceedings of the Symposium of Applied Mathematics 10 (American Mathematical Society, Providence RI, 1960) pp. 113\u2013127."},{"key":"CR49","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1007\/BF01580250","volume":"6","author":"A. Hoffman","year":"1974","unstructured":"A. Hoffman, \u201cA generalization of max-flow-min-cut,\u201dMathematical Programming 6 (1974) 352\u2013359.","journal-title":"Mathematical Programming"},{"key":"CR50","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1007\/978-94-009-7798-3_20","volume-title":"Ordered Sets","author":"A.J. Hoffman","year":"1982","unstructured":"A.J. Hoffman, \u201cOrdered sets and linear programming,\u201d in: I. Rival, ed.,Ordered Sets (D. Reidel Publishing Company, Dordrecht-Boston, MA, 1982) pp. 619\u2013654."},{"key":"CR51","first-page":"173","volume-title":"Integer Programming and Network Flows","author":"T.C. Hu","year":"1969","unstructured":"T.C. Hu,Integer Programming and Network Flows (Addison-Wesley Publishing Company, Reading MA, 1969) pp. 173\u2013175."},{"key":"CR52","doi-asserted-by":"crossref","first-page":"186","DOI":"10.15807\/jorsj.26.186","volume":"26","author":"H. Imai","year":"1983","unstructured":"H. Imai, \u201cNetwork-flow algorithms for lower truncated transversal polymatroids,\u201dJournal of the Operations Research Society of Japan 26 (1983) 186\u2013210.","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"CR53","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF01681329","volume":"9","author":"E.L. Lawler","year":"1975","unstructured":"E.L. Lawler, \u201cMatroid intersection algorithms,\u201dMathematical Programming 9 (1975) 31\u201356.","journal-title":"Mathematical Programming"},{"key":"CR54","doi-asserted-by":"crossref","unstructured":"E.L. Lawler and C.U. Martel, \u201cComputing maximal \u201cpolymatroidal\u201d network flows,\u201dMathematics of Operations Research (1982) 334\u2013347.","DOI":"10.1287\/moor.7.3.334"},{"key":"CR55","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/BF01894789","volume":"21","author":"L. Lov\u00e1sz","year":"1970","unstructured":"L. Lov\u00e1sz, \u201cA generalization of K\u00f6nig's theorem,\u201dActa Mathematica Academiae Scientiarum Hungaricae 21 (1970) 443\u2013446.","journal-title":"Acta Mathematica Academiae Scientiarum Hungaricae"},{"key":"CR56","first-page":"45","volume-title":"Combinatorial Surveys, Proceedings of the 6th British Combinatorial Conference","author":"L. Lov\u00e1sz","year":"1977","unstructured":"L. Lov\u00e1sz, \u201cFlats in matroids and geometric graphs\u201c in: P.J. Cameron, ed.,Combinatorial Surveys, Proceedings of the 6th British Combinatorial Conference (Academic Press, London, 1977) pp. 45\u201386."},{"key":"CR57","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/978-3-642-68874-4_10","volume-title":"Mathematical Programming: The State of the Art","author":"L. Lov\u00e1sz","year":"1983","unstructured":"L. Lov\u00e1sz, \u201cSubmodular functions and convexity,\u201d in: A. Bachem, M. Gr\u00f6tschel and B. Korte, eds.,Mathematical Programming: The State of the Art (Springer-Verlag, Berlin-New York, 1983) pp. 235\u2013257."},{"key":"CR58","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1137\/0603009","volume":"3","author":"L. Lov\u00e1sz","year":"1982","unstructured":"L. Lov\u00e1sz and Y. Yemini, \u201cOn generic rigidity in the plane,\u201dSIAM Journal on Algebraic and Discrete Methods 3 (1982) 91\u201398.","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"CR59","doi-asserted-by":"crossref","unstructured":"C.L. Lucchesi and D.H. Younger, \u201cA minimax relation for directed graphs,\u201dJournal of the London Mathematical Society Second Series (1978) 369\u2013374.","DOI":"10.1112\/jlms\/s2-17.3.369"},{"key":"CR60","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1002\/jgt.3190070213","volume":"7","author":"C. Mao-Cheng","year":"1973","unstructured":"C. Mao-Cheng, \u201cArc-disjoint arborescences of digraphs,\u201dJournal of Graph Theory 7 (1973) 235\u2013240.","journal-title":"Journal of Graph Theory"},{"key":"CR61","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1112\/blms\/5.1.18","volume":"29","author":"C.J.H. McDiarmid","year":"1973","unstructured":"C.J.H. McDiarmid, \u201cIndependence structures and submodular functions,\u201dBulletin of the London Mathematical Society 29 (1973) 18\u201320.","journal-title":"Bulletin of the London Mathematical Society"},{"key":"CR62","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1017\/S0305004100051677","volume":"78","author":"C.J.H. McDiarmid","year":"1975","unstructured":"C.J.H. McDiarmid, \u201cRado's theorem for polymatroids,\u201dMathematical Proceedings of the Cambridge Philosophical Society 78 (1975) 263\u2013281.","journal-title":"Mathematical Proceedings of the Cambridge Philosophical Society"},{"key":"CR63","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0095-8956(78)90008-4","volume":"25","author":"C.J.H. McDiarmid","year":"1978","unstructured":"C.J.H. McDiarmid, \u201cBlocking, anti-blocking, and pairs of matroids and polymatroids,\u201dJournal of Combinatorial Theory B 25 (1978) 313\u2013325.","journal-title":"Journal of Combinatorial Theory B"},{"key":"CR64","first-page":"263","volume-title":"Theory of Graphs (Proceedings International Symposium Roma, 1966)","author":"C.St.J.A. Nash-Williams","year":"1967","unstructured":"C.St.J.A. Nash-Williams, \u201cAn application of matroids to graph theory,\u201d in: P. Rosenstiehl, ed.,Theory of Graphs (Proceedings International Symposium Roma, 1966) (Gordon and Breach, New York and Dunod, Paris, 1967) pp. 263\u2013265."},{"key":"CR65","first-page":"133","volume-title":"Recent Progress in Combinatorics","author":"C.St.J.A. Nash-Williams","year":"1969","unstructured":"C.St.J.A. Nash-Williams, \u201cWell-balanced orientation of finite graphs and unobtrusive odd-vertex pairing,\u201d in: W.T. Tutte, ed.,Recent Progress in Combinatorics (Academic Press, New York, 1969) pp. 133\u2013149."},{"key":"CR66","doi-asserted-by":"crossref","unstructured":"W.R. Pulleyblank, \u201cPolyhedral combinatorics,\u201d in: A. Bachem, M. Gr\u00f6tschel and B. Korte, eds.,Mathematical Programming: The State of the Art (Springer-Verlag, 1983) pp. 312\u2013345.","DOI":"10.1007\/978-3-642-68874-4_13"},{"key":"CR67","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1093\/qmath\/os-13.1.83","volume":"13","author":"R. Rado","year":"1942","unstructured":"R. Rado, \u201cA theorem on independence functions,\u201dQuarterly Journal of Mathematics, Oxford 13 (1942) 83\u201389.","journal-title":"Quarterly Journal of Mathematics, Oxford"},{"key":"CR68","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1112\/plms\/s3-7.1.300","volume":"7","author":"R. Rado","year":"1957","unstructured":"R. Rado, \u201cNote on independence functions,\u201dProceedings of the London Mathematical Society, Third Series 7 (1957) 300\u2013320.","journal-title":"Proceedings of the London Mathematical Society, Third Series"},{"key":"CR69","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF01753431","volume":"1","author":"L.S. Shapley","year":"1971","unstructured":"L.S. Shapley, \u201cCores of convex games,\u201dInternational Journal of Game Theory 1 (1971) 11\u201326.","journal-title":"International Journal of Game Theory"},{"key":"CR70","volume-title":"Ganzzahlige Polymatroid-Intersektions-Algorithmen","author":"P. Sch\u00f6nsleben","year":"1980","unstructured":"P. Sch\u00f6nsleben, \u201cGanzzahlige Polymatroid-Intersektions-Algorithmen,\u201d Ph.D. Thesis, Eidgen\u00f6ssischen Technischen Hochschule, Z\u00fcrich, 1980."},{"key":"CR71","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0024-3795(81)90005-7","volume":"38","author":"A. Schrijver","year":"1981","unstructured":"A. Schrijver, \u201cOn total dual integrality,\u201dLinear Algebra and its Applications 38 (1981) 27\u201332.","journal-title":"Linear Algebra and its Applications"},{"key":"CR72","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/0095-8956(83)90066-7","volume":"35","author":"A. Schrijver","year":"1983","unstructured":"A. Schrijver, \u201cPacking and covering of crossing families of cuts,\u201dJournal of Combinatorial Theory B 35 (1983) 104\u2013128.","journal-title":"Journal of Combinatorial Theory B"},{"key":"CR73","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/B978-0-12-566780-7.50025-8","volume-title":"Progress in Combinatorial Optimization","author":"A. Schrijver","year":"1984","unstructured":"A. Schrijver, \u201cTotal dual integrality from directed graphs, crossing families and sub- and supermodular functions,\u201d in: W.R. Pulleyblank, ed.,Progress in Combinatorial Optimization (Academic Press, Toronto, Ontario, 1984) pp. 315\u2013362."},{"key":"CR74","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF02591726","volume":"29","author":"A. Schrijver","year":"1984","unstructured":"A. Schrijver, \u201cProving total dual integrality with cross-free families\u2014a general framework,\u201dMathematical Programming 29 (1984) 15\u201327.","journal-title":"Mathematical Programming"},{"key":"CR75","first-page":"327","volume-title":"Matroid Theory, Colloquia Mathematica Societatis J\u00e1nos Bolyai 40","author":"A. Schrijver","year":"1985","unstructured":"A. Schrijver, \u201cSupermodular colourings,\u201d in: A. Recski, L. Lov\u00e1sz, eds.,Matroid Theory, Colloquia Mathematica Societatis J\u00e1nos Bolyai 40 (North-Holland, Amsterdam-New York, 1985) pp. 327\u2013344."},{"key":"CR76","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"A. Schrijver,Theory of Linear and Integer Programming (Wiley, New York, 1986)."},{"key":"CR77","first-page":"359","volume-title":"Matroid Theory, Colloquia Mathematica Societatis J\u00e1nos Bolyai 40","author":"\u00c9. Tardos","year":"1985","unstructured":"\u00c9. Tardos, \u201cGeneralized matroids and supermodular colourings,\u201d in: A. Recski and L. Lov\u00e1sz, eds.,Matroid Theory, Colloquia Mathematica Societatis J\u00e1nos Bolyai 40 (North-Holland, Amsterdam-New York, 1985) pp. 359\u2013382."},{"key":"CR78","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1287\/moor.11.2.362","volume":"11","author":"\u00c9. Tardos","year":"1986","unstructured":"\u00c9. Tardos, C.A. Tovey and M.A. Trick, \u201cLayered augmenting path algorithms,\u201dMathematics of Operations Research 11 (1986) 362\u2013370.","journal-title":"Mathematics of Operations Research"},{"key":"CR79","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF02591887","volume":"30","author":"D.M. Topkis","year":"1984","unstructured":"D.M. Topkis, \u201cAdjacency on polymatroids,\u201dMathematical Programming 30 (1984) 229\u2013237.","journal-title":"Mathematical Programming"},{"key":"CR80","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1112\/jlms\/s1-36.1.221","volume":"36","author":"W.T. Tutte","year":"1961","unstructured":"W.T. Tutte, \u201cOn the problem of decomposing a graph inton connected factors,\u201dJournal of the London Mathematical Society 36 (1961) 221\u2013230.","journal-title":"Journal of the London Mathematical Society"},{"key":"CR81","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0012-365X(78)90174-7","volume":"24","author":"K. Vidyasankar","year":"1978","unstructured":"K. Vidyasankar, \u201cCovering the edge set of a directed graph with trees,\u201dDiscrete Mathematics 24 (1978) 79\u201385.","journal-title":"Discrete Mathematics"},{"key":"CR82","doi-asserted-by":"crossref","first-page":"348","DOI":"10.4153\/CJM-1975-042-7","volume":"27","author":"K. Vidyasankar","year":"1975","unstructured":"K. Vidyasankar and D. Younger, \u201cA minimax equality related to the longest directed path in an acyclic graph,\u201dCanadian Journal of Mathematics 27 (1975) 348\u2013351.","journal-title":"Canadian Journal of Mathematics"},{"key":"CR83","volume-title":"Polytopes, Graphs and Optimization","author":"V.A. Yemelichev","year":"1984","unstructured":"V.A. Yemelichev, M.M. Kovalev and M.K. Kravtscv,Polytopes, Graphs and Optimization (Cambridge University Press, Cambridge, UK, 1984)."},{"key":"CR84","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1017\/S030500410004247X","volume":"64","author":"D.J.A. Welsh","year":"1968","unstructured":"D.J.A. Welsh, \u201cKruskal's theorem for matroids,\u201dProceedings of the Cambridge Philosophical Society 64 (1968) 3\u20134.","journal-title":"Proceedings of the Cambridge Philosophical Society"},{"key":"CR85","volume-title":"Matroid Theory","author":"D.J.A. Welsh","year":"1976","unstructured":"D.J.A. Welsh,Matroid Theory (Academic Press, London, 1976)."},{"key":"CR86","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0166-218X(82)90053-1","volume":"4","author":"U. Zimmermann","year":"1982","unstructured":"U. Zimmermann, \u201cMinimization on submodular flows,\u201dDiscrete Applied Mathematics 4 (1982) 303\u2013323.","journal-title":"Discrete Applied Mathematics"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01589418.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01589418\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01589418","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T03:52:35Z","timestamp":1586231555000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01589418"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,4]]},"references-count":86,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1988,4]]}},"alternative-id":["BF01589418"],"URL":"https:\/\/doi.org\/10.1007\/bf01589418","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,4]]}}}