{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,17]],"date-time":"2026-05-17T10:25:18Z","timestamp":1779013518789,"version":"3.51.4"},"reference-count":77,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,1,25]],"date-time":"2007-01-25T00:00:00Z","timestamp":1169683200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2007,7,19]]},"DOI":"10.1007\/s10107-006-0084-2","type":"journal-article","created":{"date-parts":[[2007,1,25]],"date-time":"2007-01-25T02:00:57Z","timestamp":1169690457000},"page":"45-64","source":"Crossref","is-referenced-by-count":82,"title":["Submodular function minimization"],"prefix":"10.1007","volume":"112","author":[{"given":"Satoru","family":"Iwata","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,1,25]]},"reference":[{"key":"84_CR1","doi-asserted-by":"crossref","unstructured":"Angl\u00e8s d\u2019Auriac, J.-C.: Computing the Potts free energy and submodular functions. New Optimization Algorithms in Physics. Hartmann, A.K., Rieger, H. (eds.) pp.101\u2013117, Wiley, NewYork (2004)","DOI":"10.1002\/3527603794.ch6"},{"key":"84_CR2","doi-asserted-by":"crossref","first-page":"6973","DOI":"10.1088\/0305-4470\/35\/33\/301","volume":"35","author":"J.-C. Angl\u00e8s d\u2019Auriac","year":"2002","unstructured":"Angl\u00e8s d\u2019Auriac J.-C., Igl\u00f3i F., Preissmann M. and Seb\u0151 A. (2002). Optimal cooperation and submodularity for computing Potts\u2019 partition functions with a large number of states. J. Phys. Ser. A 35: 6973\u20136983","journal-title":"J. Phys. Ser. A"},{"key":"84_CR3","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1287\/moor.21.2.257","volume":"21","author":"D. Bertsimas","year":"1996","unstructured":"Bertsimas D. and Ni\u00f1o-Mora J. (1996). Conservation laws, extended polymatroids and multiarmed bandit problems; a polyhedral approach to indexable systems. Math. Oper. Res. 21: 257\u2013306","journal-title":"Math. Oper. Res."},{"key":"84_CR4","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1287\/moor.10.3.367","volume":"10","author":"R.E. Bixby","year":"1985","unstructured":"Bixby R.E., Cunningham W.H. and Topkis D.M. (1985). Partial order of a polymatroid extreme point. Math. Oper. Res. 10: 367\u2013378","journal-title":"Math. Oper. Res."},{"key":"84_CR5","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02604639","volume":"38","author":"A. Bouchet","year":"1987","unstructured":"Bouchet A. (1987). Greedy algorithm and symmetric matroids. Math. Program. 38: 147\u2013159","journal-title":"Math. Program."},{"key":"84_CR6","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1137\/S0895480191222926","volume":"8","author":"A. Bouchet","year":"1995","unstructured":"Bouchet A. and Cunningham W.H. (1995). Delta-matroids, jump systems and bisubmodular polyhedra. SIAM J. Discrete Math. 8: 17\u201332","journal-title":"SIAM J. Discrete Math."},{"key":"84_CR7","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0012-365X(88)90101-X","volume":"71","author":"R. Chandrasekaran","year":"1988","unstructured":"Chandrasekaran R. and Kabadi S.N. (1988). Pseudomatroids. Discrete Math. 71: 205\u2013217","journal-title":"Discrete Math."},{"key":"84_CR8","doi-asserted-by":"crossref","first-page":"810","DOI":"10.1287\/opre.28.3.810","volume":"28","author":"E.G. Coffman Jr.","year":"1980","unstructured":"Mitrani I. and Coffman E.G. (1980). A characterization of waiting time performance realizable by single-server queues. Oper. Res. 28: 810\u2013821","journal-title":"Oper. Res."},{"key":"84_CR9","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1109\/TIT.1975.1055356","volume":"21","author":"T.M. Cover","year":"1975","unstructured":"Cover T.M. (1975). A proof of the data compression theorem of Slepian and Wolf for ergodic sources. IEEE Trans. Inform. Theory IT 21: 226\u2013228","journal-title":"IEEE Trans. Inform. Theory IT"},{"key":"84_CR10","doi-asserted-by":"crossref","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"T.M. Cover","year":"1991","unstructured":"Cover T.M. and Thomas J.A. (1991). Elements of Information Theory. Wiley, Newyork"},{"key":"84_CR11","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0095-8956(84)90023-6","volume":"36","author":"W.H. Cunningham","year":"1984","unstructured":"Cunningham W.H. (1984). Testing membership in matroid polyhedra. J. Combin. Theory Ser. B 36: 161\u2013188","journal-title":"J. Combin. Theory Ser. B"},{"key":"84_CR12","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/BF02579361","volume":"5","author":"W.H. Cunningham","year":"1985","unstructured":"Cunningham W.H. (1985). On submodular function minimization. Combinatorica 5: 185\u2013192","journal-title":"Combinatorica"},{"key":"84_CR13","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/s101070100256","volume":"91","author":"W.H. Cunningham","year":"2002","unstructured":"Cunningham W.H. (2002). Matching, matroids and extensions. Math. Program. 91: 515\u2013542","journal-title":"Math. Program."},{"key":"84_CR14","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0001-8708(86)90104-0","volume":"62","author":"A.W.M. Dress","year":"1986","unstructured":"Dress A.W.M. and Havel T.F. (1986). Some combinatorial properties of discriminants in metric vector spaces. Adv. Math. 62: 285\u2013312","journal-title":"Adv. Math."},{"key":"84_CR15","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/0001-8708(92)90028-J","volume":"93","author":"A.W. M. Dress","year":"1992","unstructured":"Dress A.W. M. and Wenzel W. (1992). Valuated matroids. Adv. Math. 93: 214\u2013250","journal-title":"Adv. Math."},{"key":"84_CR16","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0022-0000(89)90038-X","volume":"38","author":"H. Edelsbrunner","year":"1989","unstructured":"Edelsbrunner H. and Guibas L.J. (1989). Topologically sweeping an arrangement. J. Comput. Syst. Sci. 38: 165\u2013194","journal-title":"J. Comput. Syst. Sci."},{"key":"84_CR17","unstructured":"Edmonds, J.: Submodular functions, matroids, and certain polyhedra. In: Guy, R., Hanani, H., Sauer, N., Sch\u00f6nheim, J. (eds.) Combinatorial Structures and Their Applications. Gordon and Breach (1970)"},{"key":"84_CR18","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J. Edmonds","year":"1972","unstructured":"Edmonds J. and Karp R.M. (1972). Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19: 248\u2013264","journal-title":"J. ACM"},{"key":"84_CR19","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1287\/opre.36.5.733","volume":"36","author":"A. Federgruen","year":"1988","unstructured":"Federgruen A. and Groenevelt H. (1988). Characterization and optimization of achievable performance in general queueing systems. Oper. Res. 36: 733\u2013741","journal-title":"Oper. Res."},{"key":"84_CR20","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1137\/S0895480198341511","volume":"18","author":"B. Fleiner","year":"2005","unstructured":"Fleiner B. (2005). Detachment of vertices of graphs preserving edge-connectivity. SIAM J. Discrete Math. 18: 581\u2013591","journal-title":"SIAM J. Discrete Math."},{"key":"84_CR21","first-page":"1","volume":"64","author":"L. Fleischer","year":"2000","unstructured":"Fleischer L. (2000). Recent progress in submodular function minimization. OPTIMA 64: 1\u201311","journal-title":"OPTIMA"},{"key":"84_CR22","doi-asserted-by":"crossref","unstructured":"Fleischer, L., Iwata, S.: Improved algorithms for submodular function minimization and submodular flow. Proceedings of the 32nd ACM Symposium on Theory of Computing 107\u2013116 (2000)","DOI":"10.1145\/335305.335318"},{"key":"84_CR23","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S0166-218X(02)00458-4","volume":"131","author":"L. Fleischer","year":"2003","unstructured":"Fleischer L. and Iwata S. (2003). A push-relabel framework for submodular function minimization and applications to parametric optimization. Discrete Appl. Math. 131: 311\u2013322","journal-title":"Discrete Appl. Math."},{"key":"84_CR24","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/s101070100253","volume":"92","author":"L., Fleischer","year":"2002","unstructured":"Fleischer L.,, Iwata S. and McCormick S.T. (2002). A faster capacity scaling algorithm for minimum cost submodular flow. Math. Programming 92: 119\u2013139","journal-title":"Math. Programming"},{"key":"84_CR25","first-page":"97","volume":"16","author":"A. Frank","year":"1982","unstructured":"Frank A. (1982). An algorithm for submodular functions on graphs. Ann. Discrete Math. 16: 97\u2013120","journal-title":"Ann. Discrete Math."},{"key":"84_CR26","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0012-365X(93)90158-P","volume":"111","author":"A. Frank","year":"1993","unstructured":"Frank A. (1993). Submodular functions in graph theory. Discrete Math. 111: 231\u2013241","journal-title":"Discrete Math."},{"key":"84_CR27","first-page":"85","volume-title":"Surveys in Combinatorics.","author":"A. Frank","year":"1993","unstructured":"Frank A. (1993). Applications of submodular functions. In: Walker, K. (eds) Surveys in Combinatorics., pp 85\u2013136. Cambridge University Press, Cambridge"},{"key":"84_CR28","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S0019-9958(78)91063-X","volume":"39","author":"S. Fujishige","year":"1978","unstructured":"Fujishige S. (1978). Polymatroidal dependence structure of a set of random variables. Inform. Contr. 39: 55\u201372","journal-title":"Inform. Contr."},{"key":"84_CR29","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1287\/moor.5.2.186","volume":"5","author":"S. Fujishige","year":"1980","unstructured":"Fujishige S. (1980). Lexicographically optimal base of a polymatroid with respect to a weight vector. Math. Oper. Res. 5: 186\u2013196","journal-title":"Math. Oper. Res."},{"key":"84_CR30","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/BF02592218","volume":"29","author":"S. Fujishige","year":"1984","unstructured":"Fujishige S. (1984). Theory of submodular programs\u2014A Fenchel-type min-max theorem and subgradients of submodular functions. Math. Programming 29: 142\u2013155","journal-title":"Math. Programming"},{"key":"84_CR31","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BFb0121012","volume":"22","author":"S. Fujishige","year":"1984","unstructured":"Fujishige S. (1984). Submodular systems and related topics. Math. Programming Stud. 22: 113\u2013131","journal-title":"Math. Programming Stud."},{"key":"84_CR32","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1137\/S0895480194264344","volume":"10","author":"S. Fujishige","year":"1997","unstructured":"Fujishige S. (1997). A min-max theorem for bisubmodular polyhedra. SIAM J. Discrete Math. 10: 294\u2013308","journal-title":"SIAM J. Discrete Math."},{"key":"84_CR33","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1080\/1055678031000081447","volume":"18","author":"S. Fujishige","year":"2003","unstructured":"Fujishige S. (2003). Submodular function minimization and related topics. Optim. Methods Softw. 18: 169\u2013180","journal-title":"Optim. Methods Softw."},{"key":"84_CR34","unstructured":"Fujishige, S.: Submodular Functions and Optimization, Elsevier (2005)"},{"key":"84_CR35","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1137\/S0895480103426339","volume":"19","author":"S. Fujishige","year":"2006","unstructured":"Fujishige S. and Iwata S. (2006). Bisubmodular function minimization. SIAM J. Discrete Math. 19: 1065\u20131073","journal-title":"SIAM J. Discrete Math."},{"key":"84_CR36","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/BF03167272","volume":"9","author":"S. Fujishige","year":"1992","unstructured":"Fujishige S. and Zhang X. (1992). New algorithms for the intersection problem of submodular systems. Japan. J. Indust. Appl. Math. 9: 369\u2013382","journal-title":"Japan. J. Indust. Appl. Math."},{"key":"84_CR37","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1137\/0218003","volume":"18","author":"G. Gallo","year":"1989","unstructured":"Gallo G., Grigoriadis M.D. and Tarjan R.E. (1989). A fast parametric network flow algorithm and applications. SIAM J. Comput. 18: 30\u201355","journal-title":"SIAM J. Comput."},{"key":"84_CR38","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"A.V. Goldberg","year":"1988","unstructured":"Goldberg A.V. and Tarjan R.E. (1988). A new approach to the maximum flow problem. J. ACM 35: 921\u2013940","journal-title":"J. ACM"},{"key":"84_CR39","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel M., Lov\u00e1sz L. and Schrijver A. (1981). The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1: 169\u2013197","journal-title":"Combinatorica"},{"key":"84_CR40","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer Heidelberg (1988)","DOI":"10.1007\/978-3-642-97881-4"},{"key":"84_CR41","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1287\/moor.25.1.36.15211","volume":"25","author":"B. Hoppe","year":"2000","unstructured":"Hoppe B. and Tardos \u00c9 (2000). The quickest transshipment problem. Math. Oper. Res. 25: 36\u201362","journal-title":"Math. Oper. Res."},{"key":"84_CR42","unstructured":"Itoko, T., Iwata, S.:Computational geometric approach to submodular function minimization for multiclass queueing systems. Technical Report METR 2005-29, University of Tokyo, October (2005)"},{"key":"84_CR43","first-page":"299","volume":"76","author":"S. Iwata","year":"1997","unstructured":"Iwata S. (1997). A capacity scaling algorithm for convex cost submodular flows. Math. Programming 76: 299\u2013308","journal-title":"Math. Programming"},{"key":"84_CR44","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1006\/jctb.2001.2072","volume":"84","author":"S. Iwata","year":"2002","unstructured":"Iwata S. (2002). A fully combinatorial algorithm for submodular function minimization. J. Combin. Theory, Ser. B 84: 203\u2013212","journal-title":"J. Combin. Theory, Ser. B"},{"key":"84_CR45","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1137\/S0097539701397813","volume":"32","author":"S. Iwata","year":"2003","unstructured":"Iwata S. (2003). A faster scaling algorithm for minimizing submodular functions. SIAM J. Comput. 32: 833\u2013840","journal-title":"SIAM J. Comput."},{"key":"84_CR46","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1145\/502090.502096","volume":"48","author":"S. Iwata","year":"2001","unstructured":"Iwata S., Fleischer L and Fujishige S. (2001). A combinatorial strongly polynomial algorithm for minimizing submodular functions. J. ACM 48: 761\u2013777","journal-title":"J. ACM"},{"key":"84_CR47","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1137\/S0895480199361533","volume":"19","author":"S. Iwata","year":"2005","unstructured":"Iwata S., McCormick S.T. and Shigeno M. (2005). A strongly polynomial cut canceling algorithm for minimum cost submodular flow. SIAM J. Discrete Math. 19: 304\u2013320","journal-title":"SIAM J. Discrete Math."},{"key":"84_CR48","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/moor.22.4.803","volume":"22","author":"S. Iwata","year":"1997","unstructured":"Iwata S., Murota K. and Shigeno M. (1997). A fast parametric submodular intersection algorithm for strong map sequences. Math. Oper. Res. 22: 803\u2013813","journal-title":"Math. Oper. Res."},{"key":"84_CR49","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1137\/S0895480199363933","volume":"17","author":"T. Jord\u00e1n","year":"2003","unstructured":"Jord\u00e1n T. and Szigeti Z. (2003). Detachments preserving local edge-connectivity of graphs. SIAM J. Discrete Math. 17: 72\u201387","journal-title":"SIAM J. Discrete Math."},{"key":"84_CR50","first-page":"191","volume":"20","author":"L.G. Khachiyan","year":"1979","unstructured":"Khachiyan L.G. (1979). A polynomail algorithm in linear programming. Soviet Math Dokl. 20: 191\u2013194","journal-title":"Soviet Math Dokl."},{"key":"84_CR51","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-21708-5","volume-title":"Combinatorial Optimization\u2014Theory and Algorithms","author":"B. Korte","year":"2000","unstructured":"Korte B. and Vygen J. (2000). Combinatorial Optimization\u2014Theory and Algorithms. Springer, Berlin"},{"key":"84_CR52","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L. Submodular functions and convexity. Mathematical Programming\u2014The State of the Art. Bachem A., Gr\u00f6tschel M., Korte B.(eds.) pp.235\u2013257 Springer, Heidelberg (1983)","DOI":"10.1007\/978-3-642-68874-4_10"},{"key":"84_CR53","doi-asserted-by":"crossref","unstructured":"McCormick, S.T.: Submodular function minimization. In: Aardal, K., Nemhauser, G., Weismantel, R. (eds.) Discrete Optimization, Handbooks in Operations Research, vol. 12, Elsevier (2005)","DOI":"10.1016\/S0927-0507(05)12007-6"},{"key":"84_CR54","doi-asserted-by":"crossref","unstructured":"McCormick, S.T., Fujishige, S.: Better algorithms for bisubmodular function minimization (2005)","DOI":"10.1137\/S0895480103426339"},{"key":"84_CR55","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01585506","volume":"7","author":"N. Megiddo","year":"1974","unstructured":"Megiddo N. (1974). Optimal flows in networks with multiple sources and sinks. Math. Programming 7: 97\u2013107","journal-title":"Math. Programming"},{"key":"84_CR56","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1287\/moor.4.4.414","volume":"4","author":"N. Megiddo","year":"1979","unstructured":"Megiddo N. (1979). Combinatorial optimization with rational objective functions. Math. Oper. Res. 4: 414\u2013424","journal-title":"Math. Oper. Res."},{"key":"84_CR57","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1145\/2157.322410","volume":"30","author":"N. Megiddo","year":"1983","unstructured":"Megiddo N. (1983). applying parallel computation algorithms in the design of serial algorithms. J. ACM 30: 852\u2013865","journal-title":"J. ACM"},{"key":"84_CR58","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1006\/aima.1996.0084","volume":"124","author":"K. Murota","year":"1996","unstructured":"Murota K. (1996). Convexity and Steinitz\u2019s exchange property. Adv. Math. 124: 272\u2013311","journal-title":"Adv. Math."},{"key":"84_CR59","first-page":"313","volume":"83","author":"K. Murota","year":"1998","unstructured":"Murota K. (1998). Discrete convex analysis. Math. Programming 83: 313\u2013371","journal-title":"Math. Programming"},{"key":"84_CR60","doi-asserted-by":"crossref","unstructured":"Murota, K.: Discrete Convex Analysis SIAM (2003)","DOI":"10.1137\/1.9780898718508"},{"key":"84_CR61","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1137\/0405004","volume":"5","author":"H. Nagamochi","year":"1992","unstructured":"Nagamochi H. and Ibaraki T. (1992). Computing edge-connectivity of multigraphs and capacitated graphs. SIAM J. Discrete Math. 5: 54\u201366","journal-title":"SIAM J. Discrete Math."},{"key":"84_CR62","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/S0020-0190(98)00114-8","volume":"67","author":"H. Nagamochi","year":"1998","unstructured":"Nagamochi H. and Ibaraki T. (1998). A note on minimizing submodular functions. Inform. Process. Lett. 67: 239\u2013244","journal-title":"Inform. Process. Lett."},{"key":"84_CR63","unstructured":"Nagano, K.: A strongly polynomial algorithm for line search in submodular polyhedra. Technical Report METR 2004-33, University of Tokyo, June 2004"},{"key":"84_CR64","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1112\/jlms\/s2-31.1.17","volume":"31","author":"C.St.J.A. Nash-Williams","year":"1985","unstructured":"Nash-Williams C.St.J.A. (1985). Connected detachments of graphs and generalized Euler trails. J. London Math. Soc. 31: 17\u201329","journal-title":"J. London Math. Soc."},{"key":"84_CR65","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0195-6698(13)80090-X","volume":"12","author":"C.St.J.A. Nash-Williams","year":"1991","unstructured":"Nash-Williams C.St.J.A. (1991). Another proof of a theorem concerning detachments of graphs. Europ. J. Combinatorics 12: 245\u2013247","journal-title":"Europ. J. Combinatorics"},{"key":"84_CR66","first-page":"33","volume":"19","author":"C.St.J.A. Nash-Williams","year":"1995","unstructured":"Nash-Williams C.St.J.A. (1995). Strongly connected mixed graphs and connected detachments of graphs. J. Combin. Math. Combin. Comput. 19: 33\u201347","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"84_CR67","first-page":"314","volume":"19","author":"C.St.J.A. Nash-Williams","year":"1995","unstructured":"Nash-Williams C.St.J.A. (1995). A direct proof of a theorem on detachments of finite graphs. J. Combin. Math. Combin. Comput. 19: 314\u2013318","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"84_CR68","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF01581271","volume":"58","author":"M. Queyranne","year":"1993","unstructured":"Queyranne M. (1993). Structure of a simple scheduling polyhedra. Math. Programming 58: 263\u2013285","journal-title":"Math. Programming"},{"key":"84_CR69","first-page":"3","volume":"82","author":"M. Queyranne","year":"1998","unstructured":"Queyranne M. (1998). Minimizing symmetric submodular functions. Math. Programming 82: 3\u201312","journal-title":"Math. Programming"},{"key":"84_CR70","unstructured":"Rizzi, R.: On minimizing symmetric set functions. 20, 445\u2013450 (2000)"},{"key":"84_CR71","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1006\/jctb.2000.1989","volume":"80","author":"A. Schrijver","year":"2000","unstructured":"Schrijver A. (2000). A combinatorial algorithm minimizing submodular functions in strongly polynomial time. J. Combin. Theory Ser. B 80: 346\u2013355","journal-title":"J. Combin. Theory Ser. B"},{"key":"84_CR72","volume-title":"Combinatorial Optimization\u2014Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver A. (2003). Combinatorial Optimization\u2014Polyhedra and Efficiency. Springer, Berlin"},{"key":"84_CR73","doi-asserted-by":"crossref","first-page":"S293","DOI":"10.1287\/opre.40.3.S293","volume":"40","author":"J.G. Shanthikumar","year":"1992","unstructured":"Shanthikumar J.G. and Yao D.D. (1992). Multiclass queueing systems: polymatroidal structure and optimal scheduling control. Oper. Res. 40: S293\u2013S299","journal-title":"Oper. Res."},{"key":"84_CR74","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF01753431","volume":"1","author":"L.S. Shapley","year":"1971","unstructured":"Shapley L.S. (1971). Cores of convex games. Int. J. Game Theory 1: 11\u201326","journal-title":"Int. J. Game Theory"},{"key":"84_CR75","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1109\/TIT.1973.1055037","volume":"IT19","author":"D. Slepian","year":"1973","unstructured":"Slepian D. and Wolf J.K. (1973). Noiseless coding with of correlated information sources. IEEE Trans. Inform. Theory IT19: 471\u2013480","journal-title":"IEEE Trans. Inform. Theory"},{"key":"84_CR76","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1016\/S0095-8956(02)00047-3","volume":"88","author":"J. Vygen","year":"2003","unstructured":"Vygen J. (2003). A note on Schrijver\u2019s submodular function minimization algorithm. J. Combin. Theory Ser. B 88: 399\u2013402","journal-title":"J. Combin. Theory Ser. B"},{"key":"84_CR77","doi-asserted-by":"crossref","first-page":"509","DOI":"10.2307\/2371182","volume":"57","author":"H. Whitney","year":"1935","unstructured":"Whitney H. (1935). On the abstract properties of linear dependence. Amer. J. Math. 57: 509\u2013533","journal-title":"Amer. J. Math."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0084-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-006-0084-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0084-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,19]],"date-time":"2020-04-19T21:55:33Z","timestamp":1587333333000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-006-0084-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,1,25]]},"references-count":77,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,7,19]]}},"alternative-id":["84"],"URL":"https:\/\/doi.org\/10.1007\/s10107-006-0084-2","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,1,25]]}}}