{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T01:40:01Z","timestamp":1749778801641,"version":"3.41.0"},"publisher-location":"Cham","reference-count":58,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319501369"},{"type":"electronic","value":"9783319501376"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","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":[[2016]]},"DOI":"10.1007\/978-3-319-50137-6_1","type":"book-chapter","created":{"date-parts":[[2016,12,2]],"date-time":"2016-12-02T10:41:48Z","timestamp":1480675308000},"page":"3-24","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Introduction to Combinatorial Optimisation in Numberjack"],"prefix":"10.1007","author":[{"given":"Barry","family":"Hurley","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barry","family":"O\u2019Sullivan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,3]]},"reference":[{"key":"1_CR1","unstructured":"Tourbier, Y., Oplobedu, A., Marcovitch, J., CHARME: un langage industriel de programmation par contraintes, illustr par une application chez Renault. In: Proceedings of the Ninth International Workshop on Expert Systems and their Applications, pp. 55\u201370 (1989)"},{"key":"1_CR2","unstructured":"Aggoun, A., Beldiceanu, N.: Extending CHIP in order to solve complex scheduling and placement problems. In: JFPL 1992, 1\u00e9res Journ\u00e9es Francophones de Programmation Logique, p. 51 (1992)"},{"key":"1_CR3","unstructured":"Amadini, R., Gabbrielli, M., Mauro, J.: A multicore tool for constraint solving. In: Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, pp. 232\u2013238 (2015)"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-04244-7_14","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"C Ans\u00f3tegui","year":"2009","unstructured":"Ans\u00f3tegui, C., Sellmann, M., Tierney, K.: A gender-based genetic algorithm for the automatic configuration of algorithms. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 142\u2013157. Springer, Heidelberg (2009). doi:10.1007\/978-3-642-04244-7_14"},{"key":"1_CR5","unstructured":"Babai, L.: Monte-carlo algorithms in graph isomorphism testing. Technical report DMS 79\u201310, Universit\u00e9 de Montr\u00e9al (1979)"},{"key":"1_CR6","unstructured":"Beldiceanu, N., Carlsson, M., Rampon, J.-X.: Global constraint catalog. Technical report SICS-T 2005\/08-SE (2005)"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/978-3-642-23786-7_4","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2011","author":"N Beldiceanu","year":"2011","unstructured":"Beldiceanu, N., Simonis, H.: A constraint seeker: finding and ranking global constraints from examples. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 12\u201326. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-23786-7_4"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-642-33558-7_13","volume-title":"Principles and Practice of Constraint Programming","author":"N Beldiceanu","year":"2012","unstructured":"Beldiceanu, N., Simonis, H.: A model seeker: extracting global constraint models from positive examples. In: Milano, M. (ed.) CP 2012. LNCS, vol. 7514, pp. 141\u2013157. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-33558-7_13"},{"key":"1_CR9","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S1574-6526(06)80007-6","volume-title":"Handbook of Constraint Programming","author":"Christian Bessiere","year":"2006","unstructured":"Bessiere, C.: Constraint propagation. In: Handbook of Constraint Programming, pp. 29\u201383 (2006)"},{"key":"1_CR10","series-title":"Frontiers in Artificial Intelligence and Applications","volume-title":"Handbook of Satisfiability","year":"2009","unstructured":"Biere, A., Heule, M.J.H., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol. 185. IOS Press, Amsterdam (2009)"},{"key":"1_CR11","unstructured":"Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting systematic search by weighting constraints. In: Proceedings of the 16th Eureopean Conference on Artificial Intelligence, ECAI 2004, pp. 146\u2013150 (2004)"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-319-18008-3_8","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"G Chu","year":"2015","unstructured":"Chu, G., Stuckey, P.J.: Learning value heuristics for constraint programming. In: Michel, L. (ed.) CPAIOR 2015. LNCS, vol. 9075, pp. 108\u2013123. Springer, Heidelberg (2015). doi:10.1007\/978-3-319-18008-3_8"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1007\/978-3-540-45193-8_58","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"R Coletta","year":"2003","unstructured":"Coletta, R., Bessi\u00e9re, C., O\u2019Sullivan, B., Freuder, E.C., O\u2019Connell, S., Quinqueton, J.: Semi-automatic modeling by constraint acquisition. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 812\u2013816. Springer, Heidelberg (2003). doi:10.1007\/978-3-540-45193-8_58"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, pp. 151\u2013158 (1971)","DOI":"10.1145\/800157.805047"},{"issue":"8","key":"1_CR15","doi-asserted-by":"publisher","first-page":"996","DOI":"10.1109\/PROC.1984.12967","volume":"72","author":"JP Costas","year":"1984","unstructured":"Costas, J.P.: A study of a class of detection waveforms having nearly ideal range - doppler ambiguity properties. Proc. IEEE 72(8), 996\u20131009 (1984)","journal-title":"Proc. IEEE"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Dooms, G.: The CP(Graph) computation domain in constraint programming. Ph.D. thesis, Universit\u00e9 catholique de Louvain, Facult\u00e9 des sciences appliqu\u00e9es (2006)","DOI":"10.1007\/11564751_18"},{"key":"1_CR17","unstructured":"Fages, J.-G.: Exploitation de structures de graphe en programmation par contraintes. (On the use of graphs within constraint-programming). Ph.D. thesis, \u00c9cole des mines de Nantes, France (2014)"},{"key":"1_CR18","unstructured":"Fitzgerald, T., Malitsky, Y., O\u2019Sullivan, B., Tierney, K.: ReACT: real-time algorithm configuration through tournaments. In: Proceedings of the Seventh Annual Symposium on Combinatorial Search, SOCS 2014 (2014)"},{"issue":"1","key":"1_CR19","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1023\/A:1009749006768","volume":"2","author":"EC Freuder","year":"1997","unstructured":"Freuder, E.C.: In pursuit of the holy grail. Constraints 2(1), 57\u201361 (1997)","journal-title":"Constraints"},{"issue":"2","key":"1_CR20","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/s10601-013-9155-1","volume":"19","author":"EC Freuder","year":"2014","unstructured":"Freuder, E.C., O\u2019Sullivan, B.: Grand challenges for constraint programming. Constraints 19(2), 150\u2013162 (2014)","journal-title":"Constraints"},{"issue":"3","key":"1_CR21","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/s10601-008-9047-y","volume":"13","author":"AM Frisch","year":"2008","unstructured":"Frisch, A.M., Harvey, W., Jefferson, C., Mart\u00ednez-Hern\u00e1ndez, B., Miguel, I.: Essence: a constraint language for specifying combinatorial problems. Constraints 13(3), 268\u2013306 (2008)","journal-title":"Constraints"},{"key":"1_CR22","unstructured":"Geelen, P.A.: Dual viewpoint heuristics for binary constraint satisfaction problems. In: Proceedings of the 10th European Conference on Artificial Intelligence, ECAI 1992, pp. 31\u201335. Wiley (1992)"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Gent, I.P., Jefferson, C., Kotthoff, L., Miguel, I., Moore, N.C.A., Nightingale, P., Petrie, K.E.: Learning when to use lazy learning in constraint solving. In: Proceedings of the 19th European Conference on Artificial Intelligence, ECAI 2010, pp. 873\u2013878 (2010)","DOI":"10.3233\/978-1-60750-606-5-873"},{"key":"1_CR24","unstructured":"Gervet, C.: Set intervals in constraint-logic programming: definition and implementation of a language. Ph.D. thesis, Universit\u00e9 de France-Compt\u00e9 (1995)"},{"key":"1_CR25","unstructured":"Gomes, C.P., Sabharwal, A.: Exploiting runtime variation in complete solvers. In: Handbook of Satisfiability, pp. 271\u2013288 (2009)"},{"issue":"1\u20132","key":"1_CR26","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1023\/A:1006314320276","volume":"24","author":"CP Gomes","year":"2000","unstructured":"Gomes, C.P., Selman, B., Crato, N., Kautz, H.: Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. J. Autom. Reason. 24(1\u20132), 67\u2013100 (2000)","journal-title":"J. Autom. Reason."},{"key":"1_CR27","unstructured":"Gomes, C.P., Selman, B., Kautz, H.A.: Boosting combinatorial search through randomization. In: Proceedings of the 15th National Conference on Artificial Intelligence, AAAI 1998, pp. 431\u2013437 (1998)"},{"issue":"3","key":"1_CR28","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"RM Haralick","year":"1980","unstructured":"Haralick, R.M., Elliott, G.L.: Increasing tree search efficiency for constraint satisfaction problems. Artif. Intell. 14(3), 263\u2013313 (1980)","journal-title":"Artif. Intell."},{"key":"1_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-642-13520-0_22","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"E Hebrard","year":"2010","unstructured":"Hebrard, E., O\u2019Mahony, E., O\u2019Sullivan, B.: Constraint programming and combinatorial optimisation in numberjack. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol. 6140, pp. 181\u2013185. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-13520-0_22"},{"key":"1_CR30","unstructured":"Van Hentenryck, P., Carillon, J.-P., Generality versus specificity: an experience with AI and OR techniques. In: Proceedings of the 7th National Conference on Artificial Intelligence, AAAI 1988, pp. 660\u2013664 (1988)"},{"key":"1_CR31","unstructured":"Hnich, B.: CSPLib problem 034: Warehouse location problem. http:\/\/www.csplib.org\/Problems\/prob034"},{"issue":"2\u20133","key":"1_CR32","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s10601-006-8061-1","volume":"11","author":"T Hulubei","year":"2006","unstructured":"Hulubei, T., O\u2019Sullivan, B.: The impact of search heuristics on heavy-tailed behaviour. Constraints 11(2\u20133), 159\u2013178 (2006)","journal-title":"Constraints"},{"key":"1_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-319-07046-9_22","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"B Hurley","year":"2014","unstructured":"Hurley, B., Kotthoff, L., Malitsky, Y., O\u2019Sullivan, B.: Proteus: a hierarchical portfolio of solvers and transformations. In: Simonis, H. (ed.) CPAIOR 2014. LNCS, vol. 8451, pp. 301\u2013317. Springer, Heidelberg (2014). doi:10.1007\/978-3-319-07046-9_22"},{"key":"1_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-642-25566-3_40","volume-title":"Learning and Intelligent Optimization","author":"F Hutter","year":"2011","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K.: Sequential model-based optimization for general algorithm configuration. In: Coello, C.A.C. (ed.) LION 2011. LNCS, vol. 6683, pp. 507\u2013523. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-25566-3_40"},{"key":"1_CR35","unstructured":"Kotthoff, L., Gent, I.P., Miguel. I.: A preliminary evaluation of machine learning in algorithm selection for search problems. In: Proceedings of the 4th Annual Symposium on Combinatorial Search, SOCS 2011 (2011)"},{"issue":"1","key":"1_CR36","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0004-3702(78)90029-2","volume":"10","author":"J-L Lauri\u00e8re","year":"1978","unstructured":"Lauri\u00e8re, J.-L.: A language and a program for stating and solving combinatorial problems. Artif. Intell. 10(1), 29\u2013127 (1978)","journal-title":"Artif. Intell."},{"issue":"4","key":"1_CR37","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0020-0190(93)90029-9","volume":"47","author":"M Luby","year":"1993","unstructured":"Luby, M., Sinclair, A., Zuckerman, D.: Optimal speedup of las vegas algorithms. Inf. Process. Lett. 47(4), 173\u2013180 (1993)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"1_CR38","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"AK Mackworth","year":"1977","unstructured":"Mackworth, A.K.: Consistency in networks of relations. Artif. Intell. 8(1), 99\u2013118 (1977)","journal-title":"Artif. Intell."},{"key":"1_CR39","doi-asserted-by":"crossref","unstructured":"Mehta, D., O\u2019Sullivan, B., Kotthoff, L., Malitsky, Y.: Lazy branching for constraint satisfaction. In: Proceedings of the 25th International Conference on Tools with Artificial Intelligence, ICTAI 2013, pp. 1012\u20131019 (2013)","DOI":"10.1109\/ICTAI.2013.152"},{"key":"1_CR40","doi-asserted-by":"crossref","unstructured":"Mehta, D., O\u2019Sullivan, B., Quesada, L., Ruffini, M., Payne, D.B., Doyle, L.: Designing resilient long-reach passive optical networks. In: Proceedings of the 23rd Conference on Innovative Applications of Artificial Intelligence, IAAI 2011 (2011)","DOI":"10.1609\/aaai.v25i2.18859"},{"key":"1_CR41","volume-title":"Linear Programming","author":"KG Murty","year":"1983","unstructured":"Murty, K.G.: Linear Programming. Wiley, Hoboken (1983)"},{"key":"1_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-540-74970-7_38","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"N Nethercote","year":"2007","unstructured":"Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.: MiniZinc: towards a standard CP modelling language. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 529\u2013543. Springer, Heidelberg (2007). doi:10.1007\/978-3-540-74970-7_38"},{"key":"1_CR43","unstructured":"O\u2019Mahony, E., Hebrard, E., Holland, A., Nugent, C., O\u2019Sullivan, B.: Using case-based reasoning in an algorithm portfolio for constraint solving. In: Irish Conference on Artificial Intelligence and Cognitive Science (2008)"},{"key":"1_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/978-3-540-30201-8_41","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"P Refalo","year":"2004","unstructured":"Refalo, P.: Impact-based search strategies for constraint programming. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 557\u2013571. Springer, Heidelberg (2004). doi:10.1007\/978-3-540-30201-8_41"},{"key":"1_CR45","unstructured":"R\u00e9gin, J.-C.: A filtering algorithm for constraints of difference in csps. In: Proceedings of the 12th National Conference on Artificial Intelligence, AAAI 1994, pp. 362\u2013367 (1994)"},{"key":"1_CR46","unstructured":"R\u00e9gin, J.-C.: Generalized arc consistency for global cardinality constraint. In: Proceedings of the 8th Innovative Applications of Artificial Intelligence Conference, IAAI 1996, pp. 209\u2013215 (1996)"},{"key":"1_CR47","series-title":"Foundations of Artificial Intelligence","volume-title":"Handbook of Constraint Programming","author":"F Rossi","year":"2006","unstructured":"Rossi, F., van Beek, P., Walsh, T.: Handbook of Constraint Programming. Foundations of Artificial Intelligence. Elsevier, New York (2006)"},{"key":"1_CR48","first-page":"10","volume-title":"Lecture Notes in Computer Science","author":"Daniel Sabin","year":"1994","unstructured":"Sabin, D., Freuder, E.C.: Contradicting conventional wisdom in constraint satisfaction. In: Proceedings of the 11th European Conference on Artificial Intelligence, ECAI 1994, pp. 125\u2013129. Springer, Heidelberg (1994)"},{"key":"1_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-642-33558-7_5","volume-title":"Principles and Practice of Constraint Programming","author":"G Simonin","year":"2012","unstructured":"Simonin, G., Artigues, C., Hebrard, E., Lopez, P.: Scheduling scientific experiments on the rosetta\/philae mission. In: Milano, M. (ed.) Principles and Practice of Constraint Programming. LNCS, vol. 7514, pp. 23\u201337. Springer, Heidelberg (2012)"},{"key":"1_CR50","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1016\/S1574-6526(06)80029-5","volume-title":"Handbook of Constraint Programming","author":"Helmut Simonis","year":"2006","unstructured":"Simonis, H.: Constraint applications in networks. In: Handbook of Constraint Programming, pp. 875\u2013903 (2006)"},{"issue":"1","key":"1_CR51","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10601-006-9011-7","volume":"12","author":"H Simonis","year":"2007","unstructured":"Simonis, H.: Models for global constraint applications. Constraints 12(1), 63\u201392 (2007)","journal-title":"Constraints"},{"key":"1_CR52","unstructured":"van Beek, P.: CSPLib problem 006: Golomb rulers. http:\/\/www.csplib.org\/Problems\/prob006"},{"key":"1_CR53","doi-asserted-by":"crossref","unstructured":"van Hoeve, W.-J., Katriel, I.: Global constraints. In: Handbook of Constraint Programming. Foundations of Artificial Intelligence, vol. 2, pp. 169\u2013208. Elsevier (2006)","DOI":"10.1016\/S1574-6526(06)80010-6"},{"issue":"1\/2","key":"1_CR54","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF00143881","volume":"1","author":"M Wallace","year":"1996","unstructured":"Wallace, M.: Practical applications of constraint programming. Constraints 1(1\/2), 139\u2013168 (1996)","journal-title":"Constraints"},{"key":"1_CR55","unstructured":"Walsh, T.: Search in a small world. In: Proceedings of the 16th International Joint Conference on Artificial Intelligence, IJCAI 1999, pp. 1172\u20131177 (1999)"},{"key":"1_CR56","volume-title":"Integer Programming","author":"LA Wolsey","year":"1998","unstructured":"Wolsey, L.A.: Integer Programming. Wiley-Interscience, New York (1998)"},{"key":"1_CR57","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1613\/jair.2490","volume":"32","author":"L Xu","year":"2008","unstructured":"Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: SATzilla: portfolio-based algorithm selection for SAT. J. Artif. Intell. Res. 32, 565\u2013606 (2008)","journal-title":"J. Artif. Intell. Res."},{"key":"1_CR58","unstructured":"Yip, Y.K.J.: The length-lex representation for constraint programming over sets. Ph.D. thesis, Brown University (2011)"}],"container-title":["Lecture Notes in Computer Science","Data Mining and Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50137-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T01:08:26Z","timestamp":1749776906000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-50137-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319501369","9783319501376"],"references-count":58,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50137-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"3 December 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}