{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,7]],"date-time":"2026-01-07T08:10:44Z","timestamp":1767773444773},"reference-count":38,"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\/bf01589420","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:09:36Z","timestamp":1114679376000},"page":"579-599","source":"Crossref","is-referenced-by-count":44,"title":["Directed submodularity, ditroids and directed submodular flows"],"prefix":"10.1007","volume":"42","author":[{"given":"Liqun","family":"Qi","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","first-page":"333","volume-title":"Advanced Techniques in the Practice of Operations Research","author":"R. Bixby","year":"1981","unstructured":"R. Bixby, \u201cMatroids and operations research,\u201d in: H.J. Greenberg, F.H. Murphy and S.H. Shaw, eds.,Advanced Techniques in the Practice of Operations Research (North-Holland, New York, 1981) pp. 333\u2013458."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0095-8956(77)90055-7","volume":"23","author":"R.G. Bland","year":"1977","unstructured":"R.G. Bland, \u201cA combinatorial abstraction of linear programming,\u201dJournal of Combinatorial Theory Series B 23 (1977) 33\u201357.","journal-title":"Journal of Combinatorial Theory Series B"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/0095-8956(78)90080-1","volume":"24","author":"R.G. Bland","year":"1978","unstructured":"R.G. Bland and M. Las Vergnas, \u201cOrientability of matroids,\u201dJournal of Combinatorial Theory Series B 24 (1978) 94\u2013123.","journal-title":"Journal of Combinatorial Theory Series B"},{"key":"CR4","first-page":"64","volume":"34","author":"W. Cook","year":"1986","unstructured":"W. Cook, \u201cOn box totally dual integral polyhedra,\u201dMathematical Programming 34 (1986) 64\u201369.","journal-title":"Mathematical Programming"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BFb0121005","volume":"22","author":"W.H. Cunningham","year":"1984","unstructured":"W.H. Cunningham and F. Barahona, \u201cA submodular network simplex method,\u201dMathematical Programming Study 22 (1984) 9\u201331.","journal-title":"Mathematical Programming Study"},{"key":"CR6","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":"CR7","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. Sch\u00f6nheim, eds.,Combinatorial Structures and Their Applications (Gordon and Breach, New York, 1970) pp. 69\u201387."},{"key":"CR8","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 on submodular functions on graph,\u201dAnnals of Discrete Mathematics 1 (1977) 185\u2013204.","journal-title":"Annals of Discrete Mathematics"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/B978-0-12-566780-7.50013-1","volume-title":"Progress in Combinatorial Optimization","author":"J. Edmonds","year":"1984","unstructured":"J. Edmonds and R. Giles, \u201cTotal dual integrality of linear inequality systems,\u201d in: W.R. Pulleyblank, ed.,Progress in Combinatorial Optimization (Academic Press, New York, 1984) pp. 117\u2013129."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BFb0121195","volume":"8","author":"M.L. Fisher","year":"1978","unstructured":"M.L. Fisher, G.L. Nemhauser and L.A. Wolsey, \u201cAn analysis of approximations for maximizing submodular set functions II,\u201dMathematical Programming Study 8 (1978) 73\u201387.","journal-title":"Mathematical Programming Study"},{"key":"CR11","first-page":"97","volume":"16","author":"A. Frank","year":"1982","unstructured":"A. Frank, \u201cAn algorithm for submodular functions on graphs,\u201dAnnals of Discrete Mathematics 16 (1982) 97\u2013120.","journal-title":"Annals of Discrete Mathematics"},{"key":"CR12","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 Series B 36 (1984) 221\u2013239.","journal-title":"Journal of Combinatorial Theory Series B"},{"key":"CR13","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, New York, 1984) pp. 147\u2013166."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0166-218X(83)90040-9","volume":"5","author":"S. Fujishige","year":"1983","unstructured":"S. Fujishige, \u201cCanonical decompositions of symmetric submodular systems,\u201dDiscrete Applied Mathematics 5 (1983) 175\u2013190.","journal-title":"Discrete Applied Mathematics"},{"key":"CR15","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":"CR16","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/BF02592218","volume":"29","author":"S. Fujishige","year":"1984","unstructured":"S. Fujishige, \u201cTheory of submodular programs: A Fenchel-type min-max theorem and subgradients of submodular functions,\u201dMathematical Programming 29 (1984) 142\u2013155.","journal-title":"Mathematical Programming"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1007\/BF02592001","volume":"29","author":"S. Fujishige","year":"1984","unstructured":"S. Fujishige, \u201cOn the subdifferential of a submodular function,\u201dMathematical Programming 29 (1984) 348\u2013360.","journal-title":"Mathematical Programming"},{"key":"CR18","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,\u201dMathematical Programming Study 22 (1984) 113\u2013131.","journal-title":"Mathematical Programming Study"},{"key":"CR19","first-page":"379","volume-title":"Operational Research '84","author":"S. Fujishige","year":"1984","unstructured":"S. Fujishige, \u201cCombinatorial optimization problems described by submodular functions,\u201d in: J.P. Brans, ed.,Operational Research '84 (North-Holland, New York, 1984) pp. 379\u2013392."},{"key":"CR20","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0024-3795(84)90147-2","volume":"63","author":"S. Fujishige","year":"1984","unstructured":"S. Fujishige, \u201cA system of linear inequalities with a submodular function on {0, \u00b11} vectors,\u201dLinear Algebra and Its Applications 63 (1984) 253\u2013266.","journal-title":"Linear Algebra and Its Applications"},{"key":"CR21","first-page":"1192","volume":"254","author":"A. Ghouila-Houri","year":"1962","unstructured":"A. Ghouila-Houri, \u201cCaracterisation des matrices totalement unimodulaires,\u201dC.R. Acad. Sci. Paris 254 (1962) 1192\u20131194.","journal-title":"C.R. Acad. Sci. Paris"},{"key":"CR22","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\u201321.","journal-title":"Networks"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/B978-0-12-566780-7.50019-2","volume-title":"Progress in Combinatorial Optimization","author":"B. Korte","year":"1984","unstructured":"B. Korte and L. Lov\u00e1sz, \u201cGreedoids\u2014a structural framework for the greedy algorithm,\u201d in: W.R. Pulleyblank, ed.,Progress in Combinatorial Optimization (Academic Press, New York, 1984) pp. 221\u2013243."},{"key":"CR24","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0095-8956(80)90082-9","volume":"29","author":"M. Las Vergnas","year":"1980","unstructured":"M. Las Vergnas, \u201cConvexity in oriented matroids,\u201dJournal of Combinatorial Theory Series B 29 (1980) 231\u2013243.","journal-title":"Journal of Combinatorial Theory Series B"},{"key":"CR25","first-page":"32","volume-title":"Combinatorial Optimization\u2014Annotated Bibliographies","author":"E.L. Lawler","year":"1985","unstructured":"E.L. Lawler, \u201cSubmodular functions and polymatroid optimization,\u201d in M. O'hEigeartaigh, J.K. Lenstra and A.H.G. Rinnooy Kan, eds.,Combinatorial Optimization\u2014Annotated Bibliographies (John Wiley & Sons, New York, 1985) pp. 32\u201338."},{"key":"CR26","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1287\/moor.7.3.334","volume":"7","author":"E.L. Lawler","year":"1982","unstructured":"E.L. Lawler and C.U. Martel, \u201cComputing \u2018maximal\u2019 polymatroidal network flows,\u201dMathematics of Operations Research 7 (1982) 334\u2013347.","journal-title":"Mathematics of Operations Research"},{"key":"CR27","first-page":"189","volume":"16","author":"E.L. Lawler","year":"1982","unstructured":"E.L. Lawler and C.U. Martel, \u201cFlow network formulation of polymatroid optimization problem,\u201dAnnals of Discrete Mathematics 16 (1982) 189\u2013200.","journal-title":"Annals of Discrete Mathematics"},{"key":"CR28","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\u2014Bonn 1982","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\u2014Bonn 1982 (Springer-Verlag, Berlin, 1983) pp. 235\u2013257."},{"key":"CR29","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"G.L. Nemhauser","year":"1978","unstructured":"G.L. Nemhauser, L.A. Wolsey and M.L. Fisher, \u201cAn analysis of approximations for maximizing submodular set functions I,\u201dMathematical Programming 14 (1978) 265\u2013294.","journal-title":"Mathematical Programming"},{"key":"CR30","doi-asserted-by":"crossref","unstructured":"L. Qi, \u201cOdd submodular functions, Dilworth functions and discrete convex functions,\u201dMathematics of Operations Research 13 (1988).","DOI":"10.1287\/moor.13.3.435"},{"key":"CR31","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/978-3-642-68874-4_18","volume-title":"Mathematical Programming: The State of the Art\u2014Bonn 1982","author":"A. Schrijver","year":"1983","unstructured":"A. Schrijver, \u201cMin-max results in combinatorial optimization,\u201d in: A. Bachem, M. Gr\u00f6tschel and B. Korte, eds.,Mathematical Programming: The State of the Art\u2014Bonn 1982 (Springer-Verlag, Berlin, 1983) pp. 439\u2013500."},{"key":"CR32","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. Pulleyblank, ed.,Progress in Combinatorial Optimization (Academic Press, New York, 1984) pp. 315\u2013361."},{"key":"CR33","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0095-8956(80)90075-1","volume":"28","author":"P.D. Seymour","year":"1980","unstructured":"P.D. Seymour, \u201cDecomposition of regular matroids,\u201dJournal of Combinatorial Theory Series B 28 (1980) 305\u2013359.","journal-title":"Journal of Combinatorial Theory Series B"},{"key":"CR34","volume-title":"Matroid Theory","author":"D.J.A. Welsh","year":"1976","unstructured":"D.J.A. Welsh,Matroid Theory (Academic Press, New York, 1976)."},{"key":"CR35","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1287\/moor.7.3.410","volume":"7","author":"L.A. Wolsey","year":"1982","unstructured":"L.A. Wolsey, \u201cMaximizing real-valued submodular functions: Primal and dual heuristics for location problems,\u201dMathematics of Operations Research 7 (1982) 410\u2013425.","journal-title":"Mathematics of Operations Research"},{"key":"CR36","first-page":"287","volume":"16","author":"U. Zimmermann","year":"1982","unstructured":"U. Zimmermann, \u201cMinimization of some nonlinear functions over polymatroidal flows,\u201dAnnals of Discrete Mathematics 16 (1982) 287\u2013302.","journal-title":"Annals of Discrete Mathematics"},{"key":"CR37","doi-asserted-by":"crossref","first-page":"302","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) 302\u2013323.","journal-title":"Discrete Applied Mathematics"},{"key":"CR38","first-page":"363","volume":"19","author":"U. Zimmermann","year":"1984","unstructured":"U. Zimmermann, \u201cMinimization of combined objective functions on integral submodular functions,\u201dAnnals of Discrete Mathematics 19 (1984) 363\u2013382.","journal-title":"Annals of Discrete Mathematics"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01589420.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01589420\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01589420","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:36:36Z","timestamp":1556897796000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01589420"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,4]]},"references-count":38,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1988,4]]}},"alternative-id":["BF01589420"],"URL":"https:\/\/doi.org\/10.1007\/bf01589420","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,4]]}}}