{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T04:08:28Z","timestamp":1746072508878,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642381706"},{"type":"electronic","value":"9783642381713"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38171-3_28","type":"book-chapter","created":{"date-parts":[[2013,4,11]],"date-time":"2013-04-11T01:30:36Z","timestamp":1365643836000},"page":"369-377","source":"Crossref","is-referenced-by-count":1,"title":["An Adaptive Model Restarts Heuristic"],"prefix":"10.1007","author":[{"given":"Nina","family":"Narodytska","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toby","family":"Walsh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/3-540-56804-2_33","volume-title":"Methodologies for Intelligent Systems","author":"J.F. Puget","year":"1993","unstructured":"Puget, J.F.: On the satisfiability of symmetrical constrained satisfaction problems. In: Komorowski, J., Ra\u015b, Z.W. (eds.) ISMIS 1993. LNCS (LNAI), vol.\u00a0689, pp. 350\u2013361. Springer, Heidelberg (1993)"},{"doi-asserted-by":"crossref","unstructured":"Shlyakhter, I.: Generating effective symmetry-breaking predicates for search problems. In: Proc. of Workshop on Theory and Applications of Satisfiability Testing, SAT 2001 (2001)","key":"28_CR2","DOI":"10.1016\/S1571-0653(04)00311-7"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/3-540-46135-3_31","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"P. Flener","year":"2002","unstructured":"Flener, P., Frisch, A.M., Hnich, B., Kiziltan, Z., Miguel, I., Pearson, J., Walsh, T.: Breaking row and column symmetries in matrix models. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 462\u2013477. Springer, Heidelberg (2002)"},{"issue":"2-3","key":"28_CR4","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10601-006-7095-8","volume":"11","author":"Y. Law","year":"2006","unstructured":"Law, Y., Lee, J.: Symmetry Breaking Constraints for Value Symmetries in Constraint Satisfaction. Constraints\u00a011(2-3), 221\u2013267 (2006)","journal-title":"Constraints"},{"unstructured":"Walsh, T.: Symmetry breaking using value precedence. In: Proc. of ECAI 2006, pp. 168\u2013172 (2006)","key":"28_CR5"},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1007\/11889205_46","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"T. Walsh","year":"2006","unstructured":"Walsh, T.: General Symmetry Breaking Constraints. In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 650\u2013664. Springer, Heidelberg (2006)"},{"unstructured":"Walsh, T.: Breaking value symmetry. In: Proc. of the 23rd National Conf. on AI, pp. 1585\u20131588. AAAI (2008)","key":"28_CR7"},{"unstructured":"Gent, I., Smith, B.: Symmetry breaking in constraint programming. In: Proc. of ECAI 2000, pp. 599\u2013603 (2000)","key":"28_CR8"},{"key":"28_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-45578-7_7","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"T. Fahle","year":"2001","unstructured":"Fahle, T., Schamberger, S., Sellmann, M.: Symmetry breaking. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, pp. 93\u2013107. Springer, Heidelberg (2001)"},{"unstructured":"Hentenryck, P.V., Agren, M., Flener, P., Pearson, J.: Tractable symmetry breaking for CSPs with interchangeable values. In: Proc. of the 18th IJCAI (2003)","key":"28_CR10"},{"key":"28_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1007\/11889205_53","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"P. Flener","year":"2006","unstructured":"Flener, P., Pearson, J., Sellmann, M., Van Hentenryck, P.: Static and dynamic structural symmetry breaking. In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 695\u2013699. Springer, Heidelberg (2006)"},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/978-3-540-85958-1_38","volume-title":"Principles and Practice of Constraint Programming","author":"D. Heller","year":"2008","unstructured":"Heller, D., Panda, A., Sellmann, M., Yip, J.: Model restarts for structural symmetry breaking. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol.\u00a05202, pp. 539\u2013544. Springer, Heidelberg (2008)"},{"unstructured":"ChocoTeam: Documentation. CHOCO is a java library for constraint satisfaction problems (CSP) and constraint programming (CP), http:\/\/choco.mines-nantes.fr\/","key":"28_CR13"},{"key":"28_CR14","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.\u00a03258, pp. 557\u2013571. Springer, Heidelberg (2004)"},{"doi-asserted-by":"crossref","unstructured":"Katsirelos, G., Walsh, T.: Symmetries of symmetry breaking constraints. In: Proc. of ECAI 2010 (2010)","key":"28_CR15","DOI":"10.3233\/978-1-60750-606-5-861"},{"key":"28_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"880","DOI":"10.1007\/978-3-540-74970-7_67","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"T. Walsh","year":"2007","unstructured":"Walsh, T.: Breaking value symmetry. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 880\u2013887. Springer, Heidelberg (2007)"},{"unstructured":"Crawford, J., Luks, G., Ginsberg, M., Roy, A.: Symmetry breaking predicates for search problems. In: Proc. of the 5th Int. Conf. on Knowledge Representation and Reasoning (KR 1996), pp. 148\u2013159 (1996)","key":"28_CR17"},{"key":"28_CR18","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. Information Processing Letters\u00a047, 173\u2013180 (1993)","journal-title":"Information Processing Letters"},{"unstructured":"Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting systematic search by weighting constraints. In: Proc. of the 16th ECAI 2004, pp. 146\u2013150 (2004)","key":"28_CR19"},{"key":"28_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BFb0017434","volume-title":"Principles and Practice of Constraint Programming - CP97","author":"C. Gomes","year":"1997","unstructured":"Gomes, C., Selman, B., Crato, N.: Heavy-tailed distributions in combinatorial search. In: Smolka, G. (ed.) CP 1997. LNCS, vol.\u00a01330, pp. 121\u2013135. Springer, Heidelberg (1997)"},{"key":"28_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-46135-3_7","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"A.M. Frisch","year":"2002","unstructured":"Frisch, A.M., Hnich, B., Kiziltan, Z., Miguel, I., Walsh, T.: Global constraints for lexicographic orderings. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 93\u2013108. Springer, Heidelberg (2002)"},{"issue":"10","key":"28_CR22","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1016\/j.artint.2006.03.002","volume":"170","author":"A. Frisch","year":"2006","unstructured":"Frisch, A., Hnich, B., Kiziltan, Z., Miguel, I., Walsh, T.: Propagation algorithms for lexicographic ordering constraints. Artificial Intelligence\u00a0170(10), 803\u2013908 (2006)","journal-title":"Artificial Intelligence"},{"key":"28_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-540-74970-7_31","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"Y.C. Law","year":"2007","unstructured":"Law, Y.C., Lee, J.H.M., Walsh, T., Yip, J.Y.K.: Breaking symmetry of interchangeable variables and values. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 423\u2013437. Springer, Heidelberg (2007)"},{"key":"28_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-642-03251-6_6","volume-title":"Recent Advances in Constraints","author":"G. Katsirelos","year":"2009","unstructured":"Katsirelos, G., Narodytska, N., Walsh, T.: Combining symmetry breaking and global constraints. In: Oddi, A., Fages, F., Rossi, F. (eds.) CSCLP 2008. LNCS, vol.\u00a05655, pp. 84\u201398. Springer, Heidelberg (2009)"},{"doi-asserted-by":"crossref","unstructured":"Jefferson, C., Kelsey, T., Linton, S., Petrie, K.: GAPLex: Generalised static symmetry breaking. In: Proc. of 6th Int. Workshop on Symmetry in Constraint Satisfaction Problems, SymCon 2006 (2006)","key":"28_CR25","DOI":"10.1002\/9780470612309.ch9"},{"key":"28_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/978-3-540-45193-8_40","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"J.-F. Puget","year":"2003","unstructured":"Puget, J.-F.: Symmetry breaking using stabilizers. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 585\u2013599. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38171-3_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T04:07:25Z","timestamp":1745986045000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38171-3_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642381706","9783642381713"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38171-3_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}