{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:22:58Z","timestamp":1725492178463},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540749691"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74970-7_65","type":"book-chapter","created":{"date-parts":[[2007,10,9]],"date-time":"2007-10-09T19:49:08Z","timestamp":1191959348000},"page":"864-871","source":"Crossref","is-referenced-by-count":0,"title":["Exploiting Single-Cycle Symmetries in Branch-and-Prune algorithms"],"prefix":"10.1007","author":[{"given":"Vicente","family":"Ruiz de Angulo","sequence":"first","affiliation":[]},{"given":"Carme","family":"Torras","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"65_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/3-540-45349-0_7","volume-title":"Principles and Practice of Constraint Programming - CP 2000","author":"F. Benhamou","year":"2000","unstructured":"Benhamou, F., Goulard, F.: Universally Quantified Interval Constraints. In: Dechter, R. (ed.) CP 2000. LNCS, vol.\u00a01894, pp. 67\u201382. Springer, Heidelberg (2000)"},{"key":"65_CR2","volume-title":"Theory and aplications of distance geometry","author":"L. Blumenthal","year":"1953","unstructured":"Blumenthal, L.: Theory and aplications of distance geometry. Oxford University Press, Oxford (1953)"},{"issue":"2-3","key":"65_CR3","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10601-006-8059-8","volume":"11","author":"D. Cohen","year":"2006","unstructured":"Cohen, D., Jeavons, P., Jefferson, Ch., Petrie, K.E., Smith, B.M.: Symmetry Definitions for Constraint Satisfaction Problems. Constraints\u00a011(2-3), 115\u2013137 (2006)","journal-title":"Constraints"},{"key":"65_CR4","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\u2013476. Springer, Heidelberg (2002)"},{"key":"65_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/3-540-46135-3_28","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"I.P. Gent","year":"2002","unstructured":"Gent, I.P., Harvey, W., Kelsey, T.: Groups and Constraints: Symmetry Breaking During Search. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 415\u2013430. Springer, Heidelberg (2002)"},{"key":"65_CR6","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0004-3702(01)00104-7","volume":"129","author":"P. Meseguer","year":"2001","unstructured":"Meseguer, P., Torras, C.: Exploiting symmetries within constraint satisfaction search. Artificial Intelligence\u00a0129, 133\u2013163 (2001)","journal-title":"Artificial Intelligence"},{"key":"65_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4664-0","volume-title":"Combinatorial enumeration of groups, graphs and chemical compounds","author":"G. Polya","year":"1987","unstructured":"Polya, G., Read, R.C.: Combinatorial enumeration of groups, graphs and chemical compounds. Springer, New York (1987)"},{"key":"65_CR8","unstructured":"Porta, J.M., Ros, L.l., Thomas, F., Corcho, F., Canto, J., Perez, J.J.: Complete maps of molecular loop conformational spaces. Journal of Computational Chemistry (to appear)"},{"issue":"2","key":"65_CR9","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1109\/TRO.2004.835450","volume":"21","author":"J.M. Porta","year":"2005","unstructured":"Porta, J.M., Ros, L.l., Thomas, F., Torras, C.: A Branch-and Prune Solver for Distance Constraints. IEEE Trans. on Robotics\u00a021(2), 176\u2013187 (2005)","journal-title":"IEEE Trans. on Robotics"},{"key":"65_CR10","unstructured":"de Angulo, R.V., Torras, C.: Exploiting single-cycle symmetries in continuous constraint satisfaction problems. IRI_DT 2007\/02 (June 2007), \n                    \n                      http:\/\/www.iri.upc.edu\/people\/ruiz\/articulos\/symmetriesreport1.pdf"},{"issue":"1","key":"65_CR11","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10601-004-5306-8","volume":"10","author":"J.-F. Puget","year":"2005","unstructured":"Puget, J.-F.: Symmetry Breaking Revisited. Constraints\u00a010(1), 23\u201346 (2005)","journal-title":"Constraints"},{"issue":"1-2","key":"65_CR12","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/BF00143879","volume":"1","author":"D. Sam-Haroud","year":"1996","unstructured":"Sam-Haroud, D., Faltings, B.: Consistency Techniques for Continuous Constraints. Constraints\u00a01(1-2), 85\u2013118 (1996)","journal-title":"Constraints"},{"key":"65_CR13","unstructured":"Vu, X.-H., Silaghi, M., Sam-Haroud, D., Faltings, B.: Branch-and-Prune Search Strategies for Numerical Constraint Solving. Swiss Federal Institute of Technology (EPFL) LIA-REPORT 7 (2006)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74970-7_65.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:49:30Z","timestamp":1619506170000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74970-7_65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540749691"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74970-7_65","relation":{},"subject":[]}}