{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:08:35Z","timestamp":1743106115918,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319200859"},{"type":"electronic","value":"9783319200866"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-20086-6_15","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T08:27:10Z","timestamp":1434702430000},"page":"193-204","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Submodular Minimization in the Context of Modern LP and MILP Methods and Solvers"],"prefix":"10.1007","author":[{"given":"Andrew","family":"Orso","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jon","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siqian","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1561\/2200000039","volume":"6","author":"F Bach","year":"2013","unstructured":"Bach, F.: Learning with submodular functions: A convex optimization perspective. Foundation and Trends in Machine Learning 6, 145\u2013373 (2013)","journal-title":"Foundation and Trends in Machine Learning"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s10107-006-0079-z","volume":"113","author":"O Briant","year":"2008","unstructured":"Briant, O., Lemarechal, C., Meurdesoif, P., Michel, S., Perrot, N., Vanderbeck, F.: Comparison of bundle and classical column generation. Math. Prog. 113, 299\u2013344 (2008)","journal-title":"Math. Prog."},{"key":"15_CR3","unstructured":"Edmonds, J.: Submodular functions, matroids, and certain polyhedra. In: Combinatorial Structures and Their Applications, pp. 69\u201387 (1970)"},{"issue":"2","key":"15_CR4","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s10107-003-0469-4","volume":"100","author":"S Elhedhli","year":"2004","unstructured":"Elhedhli, S., Goffin, J.L.: The integration of an interior-point cutting plane method within a branch-and-price algorithm. Math. Prog. 100(2), 267\u2013294 (2004)","journal-title":"Math. Prog."},{"issue":"1","key":"15_CR5","first-page":"3","volume":"7","author":"S Fujishige","year":"2011","unstructured":"Fujishige, S., Isotani, S.: A submodular function minimization algorithm based on the minimum-norm base. Pacific Journal of Optimization 7(1), 3\u201317 (2011)","journal-title":"Pacific Journal of Optimization"},{"issue":"1","key":"15_CR6","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF02288321","volume":"13","author":"D Goldfarb","year":"1988","unstructured":"Goldfarb, D., Grigoriadis, M.D.: A computational comparison of the dinic and network simplex methods for maximum flow. Ann. of OR 13(1), 81\u2013123 (1988)","journal-title":"Ann. of OR"},{"issue":"2","key":"15_CR7","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1(2), 169\u2013197 (1981)","journal-title":"Combinatorica"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1145\/502090.502096","volume":"48","author":"S Iwata","year":"2001","unstructured":"Iwata, S., Fleischer, L., Fujishige, S.: A combinatorial strongly polynomial algorithm for minimizing submodular functions. JACM 48, 761\u2013777 (2001)","journal-title":"JACM"},{"key":"15_CR9","unstructured":"Jegelka, S., Lin, H., Bilmes, J.: On fast approximate submodular minimization. In: Advances in Neural Information Processing Systems (NIPS), pp. 460\u2013468 (2011)"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Lee, J.: A First Course in Combinatorial Optimization. Cambr. Univ. Press (2004)","DOI":"10.1017\/CBO9780511616655"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L.: Submodular functions and convexity. In: Mathematical Programming The State of the Art, pp. 235\u2013257. Springer (1983)","DOI":"10.1007\/978-3-642-68874-4_10"},{"issue":"6","key":"15_CR12","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1287\/opre.1050.0234","volume":"53","author":"ME L\u00fcbbecke","year":"2005","unstructured":"L\u00fcbbecke, M.E., Desrosiers, J.: Selected topics in column generation. Operations Research 53(6), 1007\u20131023 (2005)","journal-title":"Operations Research"},{"key":"15_CR13","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/S0927-0507(05)12007-6","volume":"12","author":"ST McCormick","year":"2005","unstructured":"McCormick, S.T.: Submodular function minimization. Handbooks in Operations Research and Management Science 12, 321\u2013391 (2005)","journal-title":"Handbooks in Operations Research and Management Science"},{"issue":"2","key":"15_CR14","first-page":"346","volume":"80","author":"A Schrijver","year":"2000","unstructured":"Schrijver, A.: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. JCT, Ser. B 80(2), 346\u2013355 (2000)","journal-title":"JCT, Ser. B"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20086-6_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T08:36:16Z","timestamp":1676018176000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-20086-6_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319200859","9783319200866"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20086-6_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}