{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:52:47Z","timestamp":1752461567504,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540428633"},{"type":"electronic","value":"9783540455783"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45578-7_1","type":"book-chapter","created":{"date-parts":[[2007,5,28]],"date-time":"2007-05-28T06:34:25Z","timestamp":1180334065000},"page":"1-15","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["Hybrid Benders Decomposition Algorithms in Constraint Logic Programming"],"prefix":"10.1007","author":[{"given":"Andrew","family":"Eremin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Wallace","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,11,19]]},"reference":[{"key":"1_CR1","unstructured":"H. H. El Sakkout. Improving Backtrack Search: Three Case Studies of Localized Dynamic Hybridization. PhD thesis, Imperial College, London University, 1999."},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0895-7177(94)90127-9","volume":"12","author":"N. Beldiceanu","year":"1994","unstructured":"N. Beldiceanu and E. Contjean. Introducing global constraints in CHIP. Mathematical and Computer Modelling, 12:97\u2013123, 1994.","journal-title":"Mathematical and Computer Modelling"},{"key":"1_CR3","unstructured":"R. E. Gomory. An algorithm for integer solutions to linear programs. In R. L. Graves and P. Wolfe, editors, Recent Advances in Mathematical Programming, pages 269\u2013302. McGraw-Hill, 1963."},{"issue":"4","key":"1_CR4","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1023\/A:1009856210543","volume":"5","author":"H. H. E. Sakkout","year":"2000","unstructured":"H. H. El Sakkout and M. G. Wallace. Probe backtrack search for minimal perturbation in dynamic scheduling. Constraints, 5(4):359\u2013388, 2000.","journal-title":"Constraints"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1287\/trsc.3.1.53","volume":"3","author":"L. H. Appelgren","year":"1969","unstructured":"L. H. Appelgren. A column generation algorithm for a ship scheduling problem. Transportation Science, 3:53\u201368, 1969.","journal-title":"Transportation Science"},{"key":"1_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/b99822","volume-title":"A framework for constraint programming based column generation","author":"U. Junker","year":"2004","unstructured":"U. Junker, S. E. Karisch, N. Kohl, B. Vaaben, T. Fahle, and M. Sellmann. A framework for constraint programming based column generation. In Proceedings ofthe 5th International Conference on Principles and Practice ofConstr aint Programming-LNCS 1713, pages 261\u2013274. Springer-Verlag, 1999."},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"T. H. Yunes, A. V. Moura, and C. C. de Souza. A hybrid approach for solving large scale crew scheduling problems. In Proceedings ofthe Second International Workshop on Practical Aspects of De clarative Languages (PADL\u201900), pages 293\u2013307, Boston, MA, USA, 2000.","DOI":"10.1007\/3-540-46584-7_20"},{"key":"1_CR8","unstructured":"M. Sellmann and T. Fahle. Cp-based lagrangian relaxation for a multimedia application. In [17], 2001."},{"key":"1_CR9","unstructured":"T. Benoist, F. Laburthe, and B. Rottembourg. Lagrange relaxation and constraint programming collaborative schemes for travelling tournament problems. In [17], 2001."},{"key":"1_CR10","unstructured":"F. Focacci, A. Lodi, and M. Milano. Embedding relaxations in global constraints for solving TSP and its time constrained variant. Annals of Mathematics and Artificial Intelligence, Special issue on Large Scale Combinatorial Optimization, 2001."},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"G. B. Dantzig. Linear Programming and Extensions. Princeton University Press, 1963.","DOI":"10.7249\/R366"},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J. F. Benders","year":"1962","unstructured":"J. F. Benders. Partitioning procedures for solving mixed variables programming problems. Numerische Mathematik, 4:238\u2013252, 1962.","journal-title":"Numerische Mathematik"},{"key":"1_CR13","unstructured":"J. N. Hooker and G. Ottosson. Logic-based benders decomposition. \nhttp:\/\/ba.gsia.cmu.edu\/jnh\/papers.html\n\n, 1999."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2014 CP 2001"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45578-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,30]],"date-time":"2020-03-30T21:08:04Z","timestamp":1585602484000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45578-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540428633","9783540455783"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45578-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"19 November 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}