{"type":"ScholarlyArticle","title":"Set Branching in Constraint Optimization","authors":[{"name":"Matthew Kitching","slug":"matthew-kitching","given":"Matthew","family":"Kitching","affiliation":"Department of Computer Science , University of Toronto , Canada."},{"name":"Fahiem Bacchus","slug":"fahiem-bacchus","given":"Fahiem","family":"Bacchus","affiliation":"Department of Computer Science , University of Toronto , Canada."}],"abstract":"Branch and bound is an effective technique for solving constraint optimization problems (COP’s). However, its search space expands very rapidly as the domain sizes of the problem variables grow. In this paper, we present an algorithm that clusters the values of a variable’s domain into sets. Branch and bound can then branch on these sets of values rather than on individual values, thereby reducing the branching factor of its search space. The aim of our clustering algorithm is to construct a collection of sets such that branching on these sets will still allow effective bounding. In conjunction with the reduced branching factor, the size of the explored search space is thus significantly reduced. We test our method and show empirically that it can yield significant performance gains over existing stateof- the-art techniques.Matthew Kitching, Fahiem Bacchus","doi":null,"url":"https://ijcai.org/proceedings/2009/95","pdf":"https://ijcai.org/proceedings/2009/0095.pdf","markdown":"https://ijcai.org/proceedings/2009/95.md","bibtex":"https://ijcai.org/proceedings/2009/bibtex/95","volume":{"slug":"2009","title":"Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2009","url":"https://ijcai.org/proceedings/2009/","year":2009,"location":"Pasadena, California, USA","dates":"","editors":"Hiroaki Kitano","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":95,"pages":{"first":532,"last":536},"keywords":[],"videos":[],"references":[{"position":1,"raw":"[Bouveret et al., 2008] S. Bouveret, S. de Givry, F. Heras, J. Lar- rosa, E. Rollon, M. Sanchez, T. Schiex, G. Verfaillie, and M. M.Zytnicki. Max-csp competition 2007. In Proceedings of the Second International CSP Solver Competition, pages 19-21, 2008.","title":"Max-csp competition","authors":"S Bouveret, S De Givry, F Heras, J Larrosa, E Rollon, M Sanchez, T Schiex, G Verfaillie, M M Zytnicki","year":"2007","venue":"Proceedings of the Second International CSP Solver Competition","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Cabon et al., 1999] B. Cabon, S. de Givry, L. Lobjois, T. Schiex, and J. Warners. Radio link frequency assignment. Constraints, 4(1):79-89, 1999.","title":"Radio link frequency assignment","authors":"B Cabon, S De Givry, L Lobjois, T Schiex, J Warners","year":"1999","venue":"Constraints","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Cooper et al., 2008] Martin C. Cooper, Simon de Givry, Martí Sánchez, Thomas Schiex, and Matthias Zytnicki. Virtual arc con- sistency for weighted csp. In Proceedings of the AAAI National Conference (AAAI), pages 253-258, 2008.","title":"Virtual arc consistency for weighted csp","authors":"Martin C Cooper, Simon De Givry, Martí Sánchez, Thomas Schiex, Matthias Zytnicki","year":"2008","venue":"Proceedings of the AAAI National Conference (AAAI)","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Dincbas et al., 1988] M. Dincbas, P. Van Hentenryck, H. Simonis, A. Aggoun, T. Graf, and F. Berthier. The constraint logic pro- gramming language chip. In FGCS, pages 693-702, 1988.","title":"The constraint logic programming language chip","authors":"M Dincbas, P Van Hentenryck, H Simonis, A Aggoun, T Graf, F Berthier","year":"1988","venue":"FGCS","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Larrosa and Schiex, 2003] Javier Larrosa and Thomas Schiex. In the quest of the best form of local consistency for weighted csp. IJCAI, pages 239-244, 2003.","title":"In the quest of the best form of local consistency for weighted csp","authors":"Schiex Larrosa, Javier Larrosa, Thomas Schiex","year":"2003","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2003/35"},{"position":6,"raw":"[Larrosa, 1997] Javier Larrosa. Merging constraint satisfaction sub- problems to avoid redundant search. In IJCAI, pages 424-433, 1997.","title":"Merging constraint satisfaction subproblems to avoid redundant search","authors":"Javier Larrosa, Larrosa","year":"1997","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/1997/63"},{"position":7,"raw":"[Otsu, 1979] N. Otsu. A threshold selection method from gray level histograms. IEEE Transactions on Systems, Man and Cybernet- ics, 9:62-66, 1979.","title":"A threshold selection method from gray level histograms","authors":"N Otsu","year":"1979","venue":"IEEE Transactions on Systems, Man and Cybernetics","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Sanchez et al., 2008] M. Sanchez, S. de Givry, and T. Schiex. Mendelian error detection in complex pedigrees using weighted constraint satisfaction techniques. Constraints, 13(1), 2008.","title":"Mendelian error detection in complex pedigrees using weighted constraint satisfaction techniques","authors":"M Sanchez, S De Givry, T Schiex","year":"2008","venue":"Constraints","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Silaghi et al., 1999] M. Silaghi, D. Sam-haroud, and B. Faltings. Intelligent domain splitting for csps with ordered domains. In In- ternational Conference on Principles and Practice of Constraint Programming, pages 488-489, 1999.","title":"Intelligent domain splitting for csps with ordered domains","authors":"M Silaghi, D Sam-Haroud, B Faltings","year":"1999","venue":"International Conference on Principles and Practice of Constraint Programming","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}