{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T09:35:35Z","timestamp":1770975335012,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540218364","type":"print"},{"value":"9783540246640","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24664-0_9","type":"book-chapter","created":{"date-parts":[[2010,10,23]],"date-time":"2010-10-23T14:59:59Z","timestamp":1287845999000},"page":"127-141","source":"Crossref","is-referenced-by-count":39,"title":["Generating Benders Cuts for a\u00a0General Class of Integer Programming Problems"],"prefix":"10.1007","author":[{"given":"Yingyi","family":"Chu","sequence":"first","affiliation":[]},{"given":"Quanshi","family":"Xia","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/BF01580620","volume":"60","author":"O.E. Flippo","year":"1993","unstructured":"Flippo, O.E., Rinnoy Can, A.H.G.: Decomposition in General Mathematical Programming. Math. Programming\u00a060, 361\u2013382 (1993)","journal-title":"Math. Programming"},{"key":"9_CR2","volume-title":"Optimization Theory for Large Systems","author":"L.S. Lasdon","year":"1970","unstructured":"Lasdon, L.S.: Optimization Theory for Large Systems. MacMillan, New York (1970)"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1023\/A:1014450507312","volume":"34","author":"J. Schimpf","year":"2002","unstructured":"Schimpf, J., Wallace, M.: Finding the Right Hybrid Algorithm: A Combinatorial Meta-Problem. Annals of Mathematics and Artificial Intelligence\u00a034, 259\u2013269 (2002)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45578-7_1","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"A. Eremin","year":"2001","unstructured":"Eremin, A., Wallace, M.: Hybrid Benders Decomposition Algorithms in Constraint Logic Programming. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, pp. 1\u201315. Springer, Heidelberg (2001)"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J.F. Benders","year":"1962","unstructured":"Benders, J.F.: Partitioning Procedures for Solving Mixed-Variables Programming Problems. Numerische Mathematik\u00a04, 238\u2013252 (1962)","journal-title":"Numerische Mathematik"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF00934810","volume":"10","author":"A.M. Geoffrion","year":"1972","unstructured":"Geoffrion, A.M.: Generalised Benders Decomposition. Journal of Optimization Theory and Application\u00a010, 237\u2013260 (1972)","journal-title":"Journal of Optimization Theory and Application"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1287\/ijoc.13.4.258.9733","volume":"13","author":"V. Jain","year":"2001","unstructured":"Jain, V., Grossmann, I.E.: Algorithms for Hybrid MILP\/CP Models for a Class of Optimisation Problems. INFORMS Journal on Computing\u00a013, 258\u2013276 (2001)","journal-title":"INFORMS Journal on Computing"},{"key":"9_CR8","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10107-003-0375-9","volume":"96","author":"J.N. Hooker","year":"2003","unstructured":"Hooker, J.N., Ottosson, G.: Logic-Based Benders Decomposition. Math. Programming\u00a096, 33\u201360 (2003)","journal-title":"Math. Programming"},{"key":"9_CR9","unstructured":"Eremin, A.: Using Dual Values to Integrate Row and Column Generation into Constraint Logic Programming. PhD Thesis. Imperial College London (2003)"},{"key":"9_CR10","unstructured":"Xia, Q., Simonis, H., Chu, Y.: Generating Primary\/Secondary Path by Benders Decomposition Technique. IC-Parc Internal report, Imperial College London (2003)"},{"key":"9_CR11","unstructured":"Imperial College London: ECLiPSe 5.6 User\u2019s Manual (2003)"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Dash Inc: Dash XPRESS 14.21 User\u2019s Manual (2003)","DOI":"10.1016\/S0266-1144(03)00017-7"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24664-0_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,27]],"date-time":"2025-02-27T04:19:32Z","timestamp":1740629972000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24664-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540218364","9783540246640"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24664-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}