{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,17]],"date-time":"2026-05-17T10:18:57Z","timestamp":1779013137782,"version":"3.51.4"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2010,5,12]],"date-time":"2010-05-12T00:00:00Z","timestamp":1273622400000},"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":[[2010,7]]},"DOI":"10.1007\/s10107-010-0365-7","type":"journal-article","created":{"date-parts":[[2010,5,11]],"date-time":"2010-05-11T10:06:42Z","timestamp":1273572402000},"page":"175-182","source":"Crossref","is-referenced-by-count":121,"title":["A note on the selection of Benders\u2019 cuts"],"prefix":"10.1007","volume":"124","author":[{"given":"Matteo","family":"Fischetti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Domenico","family":"Salvagnin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arrigo","family":"Zanette","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,5,12]]},"reference":[{"issue":"3","key":"365_CR1","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1007\/s10107-002-0363-5","volume":"95","author":"E. Amaldi","year":"2003","unstructured":"Amaldi E., Pfetsch M.E., Trotter L.E. Jr: On the maximum feasible subsystem problem, IISs and IIS-hypergraphs. Math. Program. 95(3), 533\u2013554 (2003)","journal-title":"Math. Program."},{"key":"365_CR2","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s101070100235","volume":"91","author":"A. Atamt\u00fcrk","year":"2001","unstructured":"Atamt\u00fcrk A., Nemhauser G.L., Savelsbergh M.W.P.: Valid inequalities for problems with additive variable upper bounds. Math. Program. 91, 145\u2013162 (2001)","journal-title":"Math. Program."},{"key":"365_CR3","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s101070100284","volume":"92","author":"A. Atamturk","year":"2002","unstructured":"Atamturk A., Rajan D.: On splittable and unsplittable flow capacitated network design arc-set polyhedra. Math. Program. 92, 315\u2013333 (2002)","journal-title":"Math. Program."},{"key":"365_CR4","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1287\/mnsc.42.9.1229","volume":"42","author":"E. Balas","year":"1996","unstructured":"Balas E., Ceria S., Cornu\u00e9jols G.: Mixed 0\u20131 programming by lift-and-project in a branch-and-cut framework. Manage. Sci. 42, 1229\u20131246 (1996)","journal-title":"Manage. Sci."},{"key":"365_CR5","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J. Benders","year":"1962","unstructured":"Benders J.: Partitioning procedures for solving mixed-variables programming problems. Numer. Math. 4, 238\u2013252 (1962)","journal-title":"Numer. Math."},{"issue":"2","key":"365_CR6","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/s10107-008-0245-6","volume":"122","author":"F. Cadoux","year":"2009","unstructured":"Cadoux F.: Computing deep facet-defining disjunctive cuts for mixed-integer programming. Math. Program. 122(2), 197\u2013223 (2009)","journal-title":"Math. Program."},{"issue":"1","key":"365_CR7","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-006-0086-0","volume":"112","author":"G. Cornu\u00e9jols","year":"2008","unstructured":"Cornu\u00e9jols G.: Valid inequalities for mixed integer linear programs. Math. Program. Ser. B 112(1), 3\u201344 (2008)","journal-title":"Math. Program. Ser. B"},{"issue":"3","key":"365_CR8","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1007\/s10107-005-0670-8","volume":"106","author":"G. Cornu\u00e9jols","year":"2006","unstructured":"Cornu\u00e9jols G., Lemar\u00e9chal C.: A convex analysis perspective on disjunctive cuts. Math. Program. 106(3), 567\u2013586 (2006)","journal-title":"Math. Program."},{"issue":"6","key":"365_CR9","doi-asserted-by":"crossref","first-page":"1429","DOI":"10.1016\/j.cor.2003.11.012","volume":"32","author":"A.M. Costa","year":"2005","unstructured":"Costa A.M.: A survey on Benders decomposition applied to fixed-charge network design problems. Comput. Oper. Res. 32(6), 1429\u20131450 (2005)","journal-title":"Comput. Oper. Res."},{"key":"365_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0925-7721(95)00049-6","volume":"8","author":"K. Fukuda","year":"1997","unstructured":"Fukuda K., Liebling T.M., Margot F.: Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron. Comput. Geome. 8, 1\u201312 (1997)","journal-title":"Comput. Geome."},{"issue":"1","key":"365_CR11","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1287\/ijoc.2.1.61","volume":"2","author":"J. Gleeson","year":"1990","unstructured":"Gleeson J., Ryan J.: Identifying minimally infeasible subsystems of inequalities. ORSA J. Comput. 2(1), 61\u201363 (1990)","journal-title":"ORSA J. Comput."},{"key":"365_CR12","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1287\/opre.29.3.464","volume":"29","author":"T. Magnanti","year":"1981","unstructured":"Magnanti T., Wong R.: Accelerating Benders decomposition: algorithmic enhancement and model selection criteria. Oper. Res. 29, 464\u2013484 (1981)","journal-title":"Oper. Res."},{"key":"365_CR13","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1287\/mnsc.24.3.312","volume":"4","author":"D. McDaniel","year":"1977","unstructured":"McDaniel D., Devine M.: A modified Benders\u2019 partitioning algorithm for mixed integer programming. Manage. Sci. 4, 312\u2013319 (1977)","journal-title":"Manage. Sci."},{"key":"365_CR14","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1287\/ijoc.1080.0296","volume":"21","author":"W. Rei","year":"2009","unstructured":"Rei W., Cordeau J.F., Gendreau M., Soriano P.: Accelerating Benders decomposition by local branching. INFORMS J. Comput. 21, 333\u2013345 (2009)","journal-title":"INFORMS J. Comput."},{"key":"365_CR15","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/BF01194335","volume":"44","author":"P. Wentges","year":"1996","unstructured":"Wentges P.: Accelerating Benders\u2019 decomposition for the capacitated facility location problem. Math. Methods Oper. Res. 44, 267\u2013290 (1996)","journal-title":"Math. Methods Oper. Res."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0365-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-010-0365-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0365-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:50:08Z","timestamp":1559123408000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-010-0365-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,12]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["365"],"URL":"https:\/\/doi.org\/10.1007\/s10107-010-0365-7","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,12]]}}}