{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T06:38:33Z","timestamp":1648535913444},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,9,30]],"date-time":"2008-09-30T00:00:00Z","timestamp":1222732800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2009,12]]},"DOI":"10.1007\/s10601-008-9059-7","type":"journal-article","created":{"date-parts":[[2008,9,29]],"date-time":"2008-09-29T17:42:06Z","timestamp":1222710126000},"page":"506-538","source":"Crossref","is-referenced-by-count":7,"title":["Dynamic structural symmetry breaking for constraint satisfaction problems"],"prefix":"10.1007","volume":"14","author":[{"given":"Pierre","family":"Flener","sequence":"first","affiliation":[]},{"given":"Justin","family":"Pearson","sequence":"additional","affiliation":[]},{"given":"Meinolf","family":"Sellmann","sequence":"additional","affiliation":[]},{"given":"Pascal","family":"Van Hentenryck","sequence":"additional","affiliation":[]},{"given":"Magnus","family":"\u00c5gren","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,9,30]]},"reference":[{"key":"9059_CR1","volume-title":"Network flows","author":"R. Ahuja","year":"1993","unstructured":"Ahuja, R., Magnati, T., & Orlin, J. (1993). Network flows. Englewood Cliffs: Prentice Hall."},{"key":"9059_CR2","series-title":"LNCS","first-page":"73","volume-title":"Proceedings of CP\u201999","author":"R. Backofen","year":"1999","unstructured":"Backofen, R., & Will, S. (1999). Excluding symmetries in constraint-based search. In J. Jaffar (Ed.), Proceedings of CP\u201999, LNCS (Vol. 1713, pp. 73\u201387). New York: Springer."},{"key":"9059_CR3","series-title":"LNCS","first-page":"477","volume-title":"Proceedings of CP\u201902","author":"N. Barnier","year":"2002","unstructured":"Barnier, N., & Brisset, P. (2002). Solving the Kirkman\u2019s schoolgirl problem in a few seconds. In P. Van Hentenryck (Ed.), Proceedings of CP\u201902, LNCS (Vol. 2470. pp. 477\u2013491). New York: Springer."},{"key":"9059_CR4","volume-title":"Permutation groups. Number\u00a045 in London Mathematical Society Student Texts","author":"P. Cameron","year":"1999","unstructured":"Cameron, P. (1999). Permutation groups. Number\u00a045 in London Mathematical Society Student Texts. Cambridge: Cambridge University Press."},{"key":"9059_CR5","series-title":"LNCS","first-page":"17","volume-title":"Proceedings of CP\u201905","author":"D. A. Cohen","year":"2005","unstructured":"Cohen, D. A., Jeavons, P., Jefferson, C., Petrie, K. E., & Smith, B. M. (2005). Symmetry definitions for constraint satisfaction problems. In P. van Beek (Ed.) Proceedings of CP\u201905, LNCS (Vol. 3709, pp. 17\u201331). New York: Springer."},{"key":"9059_CR6","volume-title":"The CRC handbook of combinatorial designs","year":"1996","unstructured":"Colbourn, C. J., & Dinitz, J. H. (Eds.) (1996). The CRC handbook of combinatorial designs. Boca Raton: CRC."},{"key":"9059_CR7","first-page":"148","volume-title":"Proceedings of KR\u201996","author":"J. M. Crawford","year":"1996","unstructured":"Crawford, J. M., Ginsberg, M., Luks, E., & Roy, A. (1996). Symmetry-breaking predicates for search problems. In L. C. Aiello, J. Doyle, & S. C. Shapiro (Eds.), Proceedings of KR\u201996 (pp. 148\u2013159). San Francisco: Morgan Kaufmann."},{"issue":"3","key":"9059_CR8","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1093\/comjnl\/31.3.283","volume":"31","author":"M. C. Er","year":"1988","unstructured":"Er, M. C. (1988). A fast algorithm for generating set partitions. The Computer Journal, 31(3), 283\u2013284.","journal-title":"The Computer Journal"},{"key":"9059_CR9","series-title":"LNCS","first-page":"93","volume-title":"Proceedings of CP\u201901","author":"T. Fahle","year":"2001","unstructured":"Fahle, T., Schamberger, S., & Sellmann, M. (2001). Symmetry breaking. In T. Walsh (Ed.), Proceedings of CP\u201901, LNCS (Vol. 2239, pp. 93\u2013107). New York: Springer."},{"key":"9059_CR10","unstructured":"Flener, P., Frisch, A. M., Hnich, B., K\u0131z\u0131ltan, Z., Miguel, I., Pearson, J., et al. (2001). Symmetry in matrix models. In P. Flener & J. Pearson (Eds.), Proceedings of SymCon\u201901. http:\/\/www.it.uu.se\/research\/group\/astra\/SymCon01\/ ."},{"key":"9059_CR11","series-title":"LNCS","first-page":"462","volume-title":"Proceedings of CP\u201902","author":"P. Flener","year":"2002","unstructured":"Flener, P., Frisch, A. M., Hnich, B., K\u0131z\u0131ltan, Z., Miguel, I., Pearson, J., et al. (2002). Breaking row and column symmetries in matrix models. In P. Van Hentenryck (Ed.), Proceedings of CP\u201902, LNCS (Vol. 2470, pp. 462\u2013476). New York: Springer."},{"key":"9059_CR12","series-title":"LNCS","first-page":"695","volume-title":"Proceedings of CP\u201906","author":"P. Flener","year":"2006","unstructured":"Flener, P., Pearson, J., Sellmann, M., & Van Hentenryck, P. (2006). Static and dynamic structural symmetry breaking. In F. Benhamou (Ed.), Proceedings of CP\u201906, LNCS (Vol. 4204, pp. 695\u2013699). New York: Springer."},{"key":"9059_CR13","unstructured":"Flener, P., Pearson, J., & Sellmann, M. (2008). Static and dynamic structural symmetry breaking. Technical Report 2008-023, Department of Information Technology, Uppsala University, Sweden, September. http:\/\/www.it.uu.se\/research\/reports\/2008-023\/ ."},{"key":"9059_CR14","unstructured":"Flener, P., Pearson, J., Sellmann, M., & \u00c5gren, M. (2007). Structural symmetry breaking for constraint satisfaction problems. Technical Report 2007-032, Department of Information Technology, Uppsala University, Sweden, November. http:\/\/www.it.uu.se\/research\/reports\/2007-032\/ ."},{"key":"9059_CR15","series-title":"LNCS","first-page":"77","volume-title":"Proceedings of CP\u201901","author":"F. Focacci","year":"2001","unstructured":"Focacci, F., & Milano, M. (2001). Global cut framework for removing symmetries. In T. Walsh (Ed.), Proceedings of CP\u201901, LNCS (Vol. 2239, pp. 77\u201392). New York: Springer."},{"key":"9059_CR16","first-page":"227","volume-title":"Proceedings of AAAI\u201991","author":"E. C. Freuder","year":"1991","unstructured":"Freuder, E. C. (1991). Eliminating interchangeable values in constraint satisfaction problems. In Proceedings of AAAI\u201991 (pp. 227\u2013233). Menlo Park: AAAI."},{"key":"9059_CR17","first-page":"599","volume-title":"Proceedings of ECAI\u201900","author":"I. P. Gent","year":"2000","unstructured":"Gent, I. P., & Smith, B. M. (2000). Symmetry breaking during search in constraint programming. In Proceedings of ECAI\u201900 (pp. 599\u2013603). Amsterdam: IOS."},{"key":"9059_CR18","series-title":"LNCS","first-page":"721","volume-title":"Proceedings of CP\u201906","author":"D. S. Heller","year":"2006","unstructured":"Heller, D. S., & Sellmann, M. (2006). Dynamic symmetry breaking restarted. In F. Benhamou (Ed.), Proceedings of CP\u201906, LNCS (Vol. 4204, pp. 721\u2013725). New York: Springer."},{"issue":"4","key":"9059_CR19","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1145\/3341.3350","volume":"28","author":"M. Kubale","year":"1985","unstructured":"Kubale, M., & Jackowski, B. (1985). A generalized implicit enumeration algorithm for graph coloring. CACM, 28(4), 412\u2013418.","journal-title":"CACM"},{"issue":"2\u20133","key":"9059_CR20","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10601-006-7095-8","volume":"11","author":"Y. Law","year":"2006","unstructured":"Law, Y., & Lee, J. (2006). Symmetry breaking constraints for value symmetries in constraint satisfaction. Constraints, 11(2\u20133), 221\u2013267.","journal-title":"Constraints"},{"key":"9059_CR21","series-title":"LNCS","first-page":"423","volume-title":"Proceedings of CP\u201907","author":"Y. Law","year":"2007","unstructured":"Law, Y., Lee, J., Walsh, T., & Yip, J. (2007). Breaking symmetry of interchangeable variables and values. In C. Bessi\u00e8re (Ed.), Proceedings of CP\u201907, LNCS (Vol. 4741, pp. 423\u2013437). New York: Springer."},{"issue":"1\u20132","key":"9059_CR22","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/S0004-3702(01)00104-7","volume":"129","author":"P. Meseguer","year":"2001","unstructured":"Meseguer, P., & Torras, C. (2001). Exploiting symmetries within constraint satisfaction search. Artificial Intelligence, 129(1\u20132), 133\u2013163.","journal-title":"Artificial Intelligence"},{"key":"9059_CR23","series-title":"LNAI","first-page":"350","volume-title":"Proceedings of ISMIS\u201993","author":"J.-F. Puget","year":"1993","unstructured":"Puget, J.-F. (1993). On the satisfiability of symmetrical constrained satisfaction problems. In J. Komorowski & Z. Ra\u015b (Ed.), Proceedings of ISMIS\u201993, LNAI (Vol. 689, pp. 350\u2013361). New York: Springer."},{"key":"9059_CR24","series-title":"LNCS","first-page":"446","volume-title":"Proceedings of CP\u201902","author":"J.-F. Puget","year":"2002","unstructured":"Puget, J.-F. (2002). Symmetry breaking revisited. In P. Van Hentenryck (Ed.), Proceedings of CP\u201902, LNCS (Vol. 2470, pp. 446\u2013461). New York: Springer."},{"key":"9059_CR25","volume-title":"Proceedings of AAAI\u201906","author":"J.-F. Puget","year":"2006","unstructured":"Puget, J.-F. (2006). An efficient way of breaking value symmetries. In Proceedings of AAAI\u201906. Menlo Park: AAAI."},{"key":"9059_CR26","first-page":"211","volume-title":"Proceedings of ECAI\u201904","author":"C. M. Roney-Dougal","year":"2004","unstructured":"Roney-Dougal, C. M., Gent, I. P., Kelsey, T., & Linton, S. (2004). Tractable symmetry breaking using restricted search trees. In R. L. de M\u00e1ntaras & L. Saitta (Eds.), Proceedings of ECAI\u201904 (pp. 211\u2013215). Amsterdam: IOS."},{"key":"9059_CR27","unstructured":"Sellmann, M., & Van Hentenryck, P. (2005). Structural symmetry breaking. In Proceedings of IJCAI\u201905 (pp. 298\u2013303). IJCAI."},{"issue":"2","key":"9059_CR28","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s10601-006-9006-4","volume":"12","author":"M. Sellmann","year":"2007","unstructured":"Sellmann, M., Gellermann, T., & Wright, R. (2007). Cost-based filtering for shorter path constraints. Constraints, 12(2), 207\u2013238.","journal-title":"Constraints"},{"key":"9059_CR29","doi-asserted-by":"crossref","unstructured":"Shlyakhter, I. (2001). Generating effective symmetry-breaking predicates for search problems. Electronic Notes in Discrete Mathematics (Vol. 9). Proceedings of SAT\u201901.","DOI":"10.1016\/S1571-0653(04)00311-7"},{"key":"9059_CR30","unstructured":"Smith, B. M. (2001). Reducing symmetry in a combinatorial design problem. In C. Gervet & M. Wallace (Eds.), Proceedings of CP-AI-OR\u201901."},{"key":"9059_CR31","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/BF00143880","volume":"1","author":"B. M. Smith","year":"1996","unstructured":"Smith, B. M., Brailsford, S. C., Hubbard, P. M., & Williams, H. P. (1996). The progressive party problem: Integer linear programming and constraint programming compared. Constraints, 1, 119\u2013138.","journal-title":"Constraints"},{"issue":"4","key":"9059_CR32","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1287\/ijoc.14.4.345.2826","volume":"14","author":"P. Hentenryck Van","year":"2002","unstructured":"Van Hentenryck, P. (2002). Constraint and integer programming in OPL. INFORMS Journal on Computing, 14(4), 345\u2013372.","journal-title":"INFORMS Journal on Computing"},{"key":"9059_CR33","first-page":"277","volume-title":"Proceedings of IJCAI\u201903","author":"P. Hentenryck Van","year":"2003","unstructured":"Van Hentenryck, P., Flener, P., Pearson, J., & \u00c5gren, M. (2003). Tractable symmetry breaking for CSPs with interchangeable values. In Proceedings of IJCAI\u201903 (pp. 277\u2013282). San Francisco: Morgan Kaufmann."},{"key":"9059_CR34","series-title":"LNAI","first-page":"234","volume-title":"Proceedings of SARA\u201905","author":"P. Hentenryck Van","year":"2005","unstructured":"Van Hentenryck, P., Flener, P., Pearson, J., & \u00c5gren, M. (2005). Compositional derivation of symmetries for constraint satisfaction. In J.-D. Zucker & L. Saitta (Eds.), Proceedings of SARA\u201905, LNAI (Vol. 3607, pp. 234\u2013247). New York: Springer."},{"key":"9059_CR35","series-title":"LNCS","first-page":"880","volume-title":"Proceedings of CP\u201907","author":"T. Walsh","year":"2007","unstructured":"Walsh, T. (2007). Breaking value symmetry. In C. Bessi\u00e8re (Ed.), Proceedings of CP\u201907, LNCS (Vol. 4741, pp. 880\u2013887). New York: Springer."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-008-9059-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-008-9059-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-008-9059-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:14:14Z","timestamp":1559243654000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-008-9059-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,9,30]]},"references-count":35,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,12]]}},"alternative-id":["9059"],"URL":"https:\/\/doi.org\/10.1007\/s10601-008-9059-7","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,9,30]]}}}