{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T20:30:46Z","timestamp":1772656246865,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642135194","type":"print"},{"value":"9783642135200","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13520-0_10","type":"book-chapter","created":{"date-parts":[[2010,6,12]],"date-time":"2010-06-12T12:10:33Z","timestamp":1276344633000},"page":"71-86","source":"Crossref","is-referenced-by-count":8,"title":["Automatically Exploiting Subproblem Equivalence in Constraint Programming"],"prefix":"10.1007","author":[{"given":"Geoffrey","family":"Chu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria Garcia","family":"de la Banda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-72397-4_1","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"D. Baatar","year":"2007","unstructured":"Baatar, D., Boland, N., Brand, S., Stuckey, P.J.: Minimum cardinality matrix decomposition into consecutive-ones matrices: CP and IP approaches. In: Van Hentenryck, P., Wolsey, L.A. (eds.) CPAIOR 2007. LNCS, vol.\u00a04510, pp. 1\u201315. Springer, Heidelberg (2007)"},{"key":"10_CR2","volume-title":"Dynamic Programming","author":"R. Bellman","year":"1957","unstructured":"Bellman, R.: Dynamic Programming. Princeton University Press, Princeton (1957)"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-642-04244-7_21","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"G. Chu","year":"2009","unstructured":"Chu, G., Stuckey, P.J.: Minimizing the maximum number of open stacks by customer search. In: Gent, I.P. (ed.) CP 2009. LNCS, vol.\u00a05732, pp. 242\u2013257. Springer, Heidelberg (2009)"},{"key":"10_CR4","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)"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-642-04244-7_29","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"T. Feydy","year":"2009","unstructured":"Feydy, T., Stuckey, P.J.: Lazy clause generation reengineered. In: Gent, I.P. (ed.) CP 2009. LNCS, vol.\u00a05732, pp. 352\u2013366. Springer, Heidelberg (2009)"},{"key":"10_CR6","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1613\/jair.2106","volume":"28","author":"A. Fukunaga","year":"2007","unstructured":"Fukunaga, A., Korf, R.: Bin completion algorithms for multicontainer packing, knapsack, and covering problems. J. Artif. Intell. Res. (JAIR)\u00a028, 393\u2013429 (2007)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/11564751_21","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"I. Gent","year":"2005","unstructured":"Gent, I., Kelsey, T., Linton, S., McDonald, I., Miguel, I., Smith, B.: Conditional symmetry breaking. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 256\u2013270. Springer, Heidelberg (2005)"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/S1574-6526(06)80014-3","volume-title":"Handbook of Constraint Programming","author":"I. Gent","year":"2006","unstructured":"Gent, I., Petrie, K., Puget, J.-F.: Symmetry in Constraint Programming. In: Handbook of Constraint Programming, pp. 329\u2013376. Elsevier, Amsterdam (2006)"},{"key":"10_CR9","unstructured":"Hnich, B., Kiziltan, Z., Walsh, T.: Modelling a balanced academic curriculum problem. In: Proceedings of CPAIOR 2002, pp. 121\u2013131 (2002)"},{"key":"10_CR10","unstructured":"Kitching, M., Bacchus, F.: Symmetric component caching. In: Proceedings of IJCAI 2007, pp. 118\u2013124 (2007)"},{"key":"10_CR11","unstructured":"Lynce, I., Baptista, L., Marques-Silva, J.: Complete search restart strategies for satisfiability. In: IJCAI Workshop on Stochastic Search Algorithms, pp. 1\u20135 (2001)"},{"key":"10_CR12","unstructured":"Marinescu, R., Dechter, R.: And\/or branch-and-bound for graphical models. In: Proceedings of IJCAI 2005, pp. 224\u2013229 (2005)"},{"key":"10_CR13","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.\u00a04741, pp. 529\u2013543. Springer, Heidelberg (2007)"},{"issue":"3","key":"10_CR14","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s10601-008-9064-x","volume":"14","author":"O. Ohrimenko","year":"2009","unstructured":"Ohrimenko, O., Stuckey, P.J., Codish, M.: Propagation via lazy clause generation. Constraints\u00a014(3), 357\u2013391 (2009)","journal-title":"Constraints"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/11564751_4","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"P.J. Stuckey","year":"2005","unstructured":"Stuckey, P.J., Garcia de la Banda, M., Maher, M.J., Marriott, K., Slaney, J.K., Somogyi, Z., Wallace, M., Walsh, T.: The G12 project: Mapping solver independent models to efficient solutions. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 13\u201316. Springer, Heidelberg (2005)"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Puchinger, J., Stuckey, P.J.: Automating branch-and-bound for dynamic programs. In: Proceedings of PEPM 2008, pp. 81\u201389 (2008)","DOI":"10.1145\/1328408.1328421"},{"key":"10_CR17","unstructured":"Schulte, C., Lagerkvist, M., Tack, G.: Gecode, \n                  \n                    http:\/\/www.gecode.org\/"},{"key":"10_CR18","unstructured":"Smith, B., Gent, I.: Constraint modelling challenge report 2005 (2005), \n                  \n                    http:\/\/www.cs.st-andrews.ac.uk\/~ipg\/challenge\/ModelChallenge05.pdf"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/11564751_47","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"B.M. Smith","year":"2005","unstructured":"Smith, B.M.: Caching search states in permutation problems. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 637\u2013651. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13520-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T10:40:05Z","timestamp":1552560005000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13520-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642135194","9783642135200"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13520-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}