{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:20:49Z","timestamp":1725747649747},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642406263"},{"type":"electronic","value":"9783642406270"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40627-0_25","type":"book-chapter","created":{"date-parts":[[2013,9,7]],"date-time":"2013-09-07T07:11:01Z","timestamp":1378537861000},"page":"299-314","source":"Crossref","is-referenced-by-count":5,"title":["Model Combinators for Hybrid Optimization"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Fontaine","sequence":"first","affiliation":[]},{"given":"Laurent","family":"Michel","sequence":"additional","affiliation":[]},{"given":"Pascal","family":"Van Hentenryck","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Akgun, O., Miguel, I., Jefferson, C., Frisch, A., Hnich, B.: Extensible automated constraint modelling (2011)","DOI":"10.1609\/aaai.v25i1.7820"},{"issue":"9","key":"25_CR2","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1145\/1995376.1995394","volume":"54","author":"L. Moura De","year":"2011","unstructured":"De Moura, L., Bj\u00f8rner, N.: Satisfiability modulo theories: introduction and applications. Commun. ACM\u00a054(9), 69\u201377 (2011)","journal-title":"Commun. ACM"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/978-3-540-89982-2_45","volume-title":"Logic Programming","author":"G.J. Duck","year":"2008","unstructured":"Duck, G.J., De Koninck, L., Stuckey, P.J.: Cadmium: An implementation of ACD term rewriting. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol.\u00a05366, pp. 531\u2013545. Springer, Heidelberg (2008)"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/11799573_11","volume-title":"Logic Programming","author":"G. Duck","year":"2006","unstructured":"Duck, G., Stuckey, P., Brand, S.: Acd term rewriting. In: Etalle, S., Truszczy\u0144ski, M. (eds.) ICLP 2006. LNCS, vol.\u00a04079, pp. 117\u2013131. Springer, Heidelberg (2006)"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/978-3-642-04244-7_28","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"M.M. Fazel-Zarandi","year":"2009","unstructured":"Fazel-Zarandi, M.M., Beck, J.C.: Solving a Location-Allocation Problem with Logic-Based Benders\u2019 Decomposition. In: Gent, I.P. (ed.) CP 2009. LNCS, vol.\u00a05732, pp. 344\u2013351. Springer, Heidelberg (2009)"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-642-29828-8_12","volume-title":"Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems","author":"D. Fontaine","year":"2012","unstructured":"Fontaine, D., Michel, L.: A high level language for solver independent model manipulation and generation of hybrid solvers. In: Beldiceanu, N., Jussien, N., Pinson, \u00c9. (eds.) CPAIOR 2012. LNCS, vol.\u00a07298, pp. 180\u2013194. Springer, Heidelberg (2012)"},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/s10601-008-9047-y","volume":"13","author":"A. Frisch","year":"2008","unstructured":"Frisch, A., Harvey, W., Jefferson, C., Mart\u00ednez-Hern\u00e1ndez, B., Miguel, I.: Essence: A constraint language for specifying combinatorial problems. Constraints\u00a013, 268\u2013306 (2008)","journal-title":"Constraints"},{"key":"25_CR8","unstructured":"Seldin, J.P., Roger Hindley, J.: Lambda-Calculus and Combinators An Introduction, 2nd edn. Cambridge University Press (2008)"},{"key":"25_CR9","unstructured":"Puchinger, J., Stuckey, P.J., Wallace, M., Brand, S.: From high-level model to branch-and-price solution in g12 (2008)"},{"issue":"1","key":"25_CR10","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10601-009-9085-0","volume":"16","author":"J. Puchinger","year":"2011","unstructured":"Puchinger, J., Stuckey, P.J., Wallace, M.G., Brand, S.: Dantzig-wolfe decomposition and branch-and-price solving in g12. Constraints\u00a016(1), 77\u201399 (2011)","journal-title":"Constraints"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/3-540-45349-0_27","volume-title":"Principles and Practice of Constraint Programming - CP 2000","author":"P. Refalo","year":"2000","unstructured":"Refalo, P.: Linear Formulation of Constraint Programming Models and Hybrid Solvers. In: Dechter, R. (ed.) CP 2000. LNCS, vol.\u00a01894, pp. 369\u2013383. Springer, Heidelberg (2000)"},{"key":"25_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1007\/978-3-642-23786-7_58","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2011","author":"T. Schrijvers","year":"2011","unstructured":"Schrijvers, T., Tack, G., Wuille, P., Samulowitz, H., Stuckey, P.J.: Search combinators. In: Lee, J. (ed.) CP 2011. LNCS, vol.\u00a06876, pp. 774\u2013788. Springer, Heidelberg (2011)"},{"key":"25_CR13","unstructured":"Van Hentenryck, P., Michel, L.: Search = continuations + controllers. In: Proceedings of the 19th International Conference on Principles and Practice of Constraint Programming (submitted, September 2013)"},{"issue":"2","key":"25_CR14","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1287\/opre.1090.0733","volume":"58","author":"T. Yunes","year":"2010","unstructured":"Yunes, T., Aron, I.D., Hooker, J.N.: An integrated solver for optimization problems. Oper. Res.\u00a058(2), 342\u2013356 (2010)","journal-title":"Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40627-0_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T11:09:38Z","timestamp":1688468978000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40627-0_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642406263","9783642406270"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40627-0_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}