{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T21:56:38Z","timestamp":1773438998615,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,4,7]],"date-time":"2011-04-07T00:00:00Z","timestamp":1302134400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1007\/s10479-011-0883-6","type":"journal-article","created":{"date-parts":[[2011,4,6]],"date-time":"2011-04-06T17:58:39Z","timestamp":1302112719000},"page":"57-72","source":"Crossref","is-referenced-by-count":70,"title":["On generating maximal nondominated Benders cuts"],"prefix":"10.1007","volume":"210","author":[{"given":"Hanif D.","family":"Sherali","sequence":"first","affiliation":[]},{"given":"Brian J.","family":"Lunday","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,4,7]]},"reference":[{"key":"883_CR1","volume-title":"Linear programming and network flows","author":"M. S. Bazaraa","year":"2010","unstructured":"Bazaraa, M. S., Jarvis, J. J., & Sherali, H. D. (2010). Linear programming and network flows (4th edn.). Hoboken: Wiley.","edition":"4"},{"issue":"1","key":"883_CR2","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J. F. Benders","year":"1962","unstructured":"Benders, J. F. (1962). Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4(1), 238\u2013252.","journal-title":"Numerische Mathematik"},{"issue":"4","key":"883_CR3","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1287\/opre.1060.0286","volume":"54","author":"G. Codato","year":"2006","unstructured":"Codato, G., & Fischetti, M. (2006). Combinatorial Benders\u2019 cuts for mixed-integer linear programming. Operations Research, 54(4), 756\u2013766.","journal-title":"Operations Research"},{"issue":"6","key":"883_CR4","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. (2005). A survey on Benders decomposition applied to fixed-charge network design problems. Computers & Operations Research, 32(6), 1429\u20131450.","journal-title":"Computers & Operations Research"},{"issue":"3","key":"883_CR5","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0377-2217(84)90287-X","volume":"16","author":"G. C\u00f4t\u00e9","year":"1984","unstructured":"C\u00f4t\u00e9, G., & Laughton, M. A. (1984). Large-scale mixed integer programming: Benders-type heuristics. European Journal of Operational Research, 16(3), 327\u2013333.","journal-title":"European Journal of Operational Research"},{"issue":"1\u20133","key":"883_CR6","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M. Fischetti","year":"2003","unstructured":"Fischetti, M., & Lodi, A. (2003). Local branching. Mathematical Programming, 98(1\u20133), 23\u201347.","journal-title":"Mathematical Programming"},{"issue":"1\u20132","key":"883_CR7","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s10107-010-0365-7","volume":"124","author":"M. Fischetti","year":"2010","unstructured":"Fischetti, M., Salvagnin, D., & Zanette, A. (2010). A note of the selection of Benders\u2019 cuts. Mathematical Programming, 124(1\u20132), 175\u2013182.","journal-title":"Mathematical Programming"},{"issue":"4","key":"883_CR8","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF00934810","volume":"10","author":"A. M. Geoffrion","year":"1972","unstructured":"Geoffrion, A. M. (1972). Generalized Benders decomposition. Journal of Optimization Theory and Applications, 10(4), 237\u2013260.","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"5","key":"883_CR9","doi-asserted-by":"crossref","first-page":"822","DOI":"10.1287\/mnsc.20.5.822","volume":"20","author":"A. M. Geoffrion","year":"1974","unstructured":"Geoffrion, A. M., & Graves, G. W. (1974). Multicommodity distribution system design by Benders decomposition. Management Science, 20(5), 822\u2013844.","journal-title":"Management Science"},{"issue":"4","key":"883_CR10","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/s11590-006-0030-5","volume":"1","author":"M. Haouari","year":"2007","unstructured":"Haouari, M., Mrad, M., & Sherali, H. D. (2007). Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements. Optimization Letters, 1(4), 341\u2013354.","journal-title":"Optimization Letters"},{"issue":"3","key":"883_CR11","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1287\/opre.29.3.464","volume":"29","author":"T. L. Magnanti","year":"1981","unstructured":"Magnanti, T. L., & Wong, R. T. (1981). Accelerating Benders decomposition: algorithmic enhancement and model selection criteria. Operations Research, 29(3), 464\u2013484.","journal-title":"Operations Research"},{"key":"883_CR12","first-page":"209","volume-title":"Discrete location theory","author":"T. L. Magnanti","year":"1990","unstructured":"Magnanti, T. L., & Wong, R. T. (1990). Decomposition methods for facility location problems. In P.\u00a0B. Mirchandani & R.\u00a0L. Francis (Eds.), Discrete location theory (pp. 209\u2013262). Hoboken: Wiley."},{"issue":"3","key":"883_CR13","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1287\/mnsc.24.3.312","volume":"24","author":"D. McDaniel","year":"1977","unstructured":"McDaniel, D., & Devine, M. (1977). A modified Benders\u2019 partitioning algorithm for mixed integer programming. Management Science, 24(3), 312\u2013319.","journal-title":"Management Science"},{"issue":"8","key":"883_CR14","doi-asserted-by":"crossref","first-page":"2251","DOI":"10.1016\/j.cor.2005.09.001","volume":"34","author":"A. Mercier","year":"2007","unstructured":"Mercier, A., & Soumis, F. (2007). An integrated aircraft routing, crew scheduling, and flight retiming model. Computers & Operations Research, 34(8), 2251\u20132265.","journal-title":"Computers & Operations Research"},{"issue":"6","key":"883_CR15","doi-asserted-by":"crossref","first-page":"1451","DOI":"10.1016\/j.cor.2003.11.013","volume":"32","author":"A. Mercier","year":"2005","unstructured":"Mercier, A., Cordeau, J., & Soumis, F. (2005). A computational study of benders decomposition for the integrated aircraft routing and crew scheduling problem. Computers & Operations Research, 32(6), 1451\u20131476.","journal-title":"Computers & Operations Research"},{"key":"883_CR16","volume-title":"Integer and combinatorial optimization","author":"G. L. Nemhauser","year":"1999","unstructured":"Nemhauser, G. L., & Wolsey, L. A. (1999). Integer and combinatorial optimization. Hoboken: Wiley."},{"issue":"4","key":"883_CR17","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1016\/j.orl.2008.01.005","volume":"36","author":"N. Papadakos","year":"2008","unstructured":"Papadakos, N. (2008). Practical enhancements to the Magnanti-Wong method. Operations Research Letters, 36(4), 444\u2013449.","journal-title":"Operations Research Letters"},{"issue":"1","key":"883_CR18","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/j.cor.2007.08.002","volume":"36","author":"N. Papadakos","year":"2009","unstructured":"Papadakos, N. (2009). Integrated airline scheduling. Computers & Operations Research, 36(1), 176\u2013195.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"883_CR19","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. (2009). Accelerating Benders decomposition by local branching. INFORMS Journal on Computing, 21(2), 333\u2013345.","journal-title":"INFORMS Journal on Computing"},{"issue":"8","key":"883_CR20","doi-asserted-by":"crossref","first-page":"1237","DOI":"10.1016\/j.compchemeng.2009.10.002","volume":"34","author":"G. K. D. Saharidis","year":"2010","unstructured":"Saharidis, G. K. D., & Ierapetritou, M. G. (2010). Improving Benders decomposition using maximum feasible subsystem (MFS) cut generation strategy. Computers & Chemical Engineering, 34(8), 1237\u20131245.","journal-title":"Computers & Chemical Engineering"},{"issue":"2","key":"883_CR21","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1111\/j.1475-3995.2009.00706.x","volume":"17","author":"G. K. D. Saharidis","year":"2010","unstructured":"Saharidis, G. K. D., Minoux, M., & Ierapetritou, M. G. (2010). Accelerating Benders method using covering cut bundle generation. International Transactions in Operational Research, 17(2), 221\u2013237.","journal-title":"International Transactions in Operational Research"},{"key":"883_CR22","volume-title":"Proceedings of the 44th AGIFORS annual symposium","author":"R. Sandhu","year":"2004","unstructured":"Sandhu, R., & Klabjan, D. (2004). Integrated airline planning. In Proceedings of the 44th AGIFORS annual symposium, Singapore."},{"issue":"1","key":"883_CR23","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.ejor.2004.01.046","volume":"167","author":"T. Santoso","year":"2005","unstructured":"Santoso, T., Ahmed, S., Goetschalckx, M., & Shapiro, A. (2005). A stochastic programming approach for supply chain network design under uncertainty. European Journal of Operational Research, 167(1), 96\u2013115.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"883_CR24","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/0377-2217(82)90202-8","volume":"11","author":"H. D. Sherali","year":"1982","unstructured":"Sherali, H. D. (1982). Equivalent weights for lexicographic multi-objective programs: characterizations and computations. European Journal of Operational Research, 11(4), 367\u2013379.","journal-title":"European Journal of Operational Research"},{"key":"883_CR25","unstructured":"Sherali, H. D., Bae, K., & Haouari, M. (2010). A Benders decomposition approach for an integrated airline schedule design and fleet assignment problem with flight retiming, schedule balance, and demand recapture. Annals of Operations Research (to appear)."},{"issue":"2","key":"883_CR26","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF00934527","volume":"39","author":"H. D. Sherali","year":"1983","unstructured":"Sherali, H. D., & Soyster, A. L. (1983). Preemptive and nonpreemptive multi-objective programming: relationships and counterexamples. Journal of Optimization Theory and Applications, 39(2), 173\u2013186.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"883_CR27","volume-title":"Multiple criteria optimization: theory, computation, and application","author":"R. E. Steuer","year":"1986","unstructured":"Steuer, R. E. (1986). Multiple criteria optimization: theory, computation, and application. Hoboken: Wiley."},{"issue":"1","key":"883_CR28","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1007\/BF02591718","volume":"25","author":"T. J. Roy Van","year":"1983","unstructured":"Van Roy, T. J. (1983). Cross decomposition for mixed integer programming. Mathematical Programming, 25(1), 46\u201363.","journal-title":"Mathematical Programming"},{"issue":"2","key":"883_CR29","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/BF01194335","volume":"44","author":"P. Wentges","year":"1996","unstructured":"Wentges, P. (1996). Accelerating Benders\u2019 decomposition for the capacitated facility location problem. Mathematical Methods of Operations Research, 44(2), 267\u2013290.","journal-title":"Mathematical Methods of Operations Research"},{"issue":"3","key":"883_CR30","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1137\/S1052623497318700","volume":"10","author":"G. Zakeri","year":"1998","unstructured":"Zakeri, G., Philpott, A. B., & Ryan, D. M. (1998). Inexact cuts in Benders\u2019 decomposition. SIAM Journal on Optimization, 10(3), 643\u2013657.","journal-title":"SIAM Journal on Optimization"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-011-0883-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-011-0883-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-011-0883-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:08:06Z","timestamp":1559138886000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-011-0883-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,7]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["883"],"URL":"https:\/\/doi.org\/10.1007\/s10479-011-0883-6","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4,7]]}}}