{"type":"ScholarlyArticle","title":"Automatic Dominance Breaking for a Class of Constraint Optimization Problems","authors":[{"name":"Jimmy Lee","slug":"jimmy-lee","given":"Jimmy","family":"Lee","affiliation":"Department of Computer Science and Engineering The Chinese University of Hong Kong Shatin , N.T. , Hong Kong"},{"name":"Allen Zhong","slug":"allen-zhong","given":"Allen","family":"Zhong","affiliation":"Department of Computer Science and Engineering The Chinese University of Hong Kong Shatin , N.T. , Hong Kong"}],"abstract":"Exploiting dominance relations in many Constraint Optimization Problems can drastically speed up the solving process in practice. Identification and utilization of dominance relations, however, usually require human expertise. We present a theoretical framework for a useful class of constraint optimization problems to detect dominance automatically and formulate the generation of the associated dominance breaking nogoods as constraint satisfaction. By controlling the length and quantity of the nogoods, our method can generate dominance break- ing nogoods of varying strengths. Experimentation confirms runtime improvements of up to three orders of magnitude against manual methods.","doi":"10.24963/ijcai.2020/166","url":"https://ijcai.org/proceedings/2020/166","pdf":"https://ijcai.org/proceedings/2020/0166.pdf","markdown":"https://ijcai.org/proceedings/2020/166.md","bibtex":"https://ijcai.org/proceedings/2020/bibtex/166","volume":{"slug":"2020","title":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2020","url":"https://ijcai.org/proceedings/2020/","year":2020,"location":"Yokohama","dates":"January 2021 (postponed from 11-17 July 2020)","editors":"Christian Bessiere","isbn":"978-0-9992411-6-5","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2020"},"section":"Constraints and SAT","track":"Main track","number":166,"pages":{"first":1192,"last":1200},"keywords":["Constraints and SAT: Constraint Satisfaction","Constraints and SAT: Constraints: Modeling, Solvers, Applications","Constraints and SAT: Constraint Optimization"],"videos":[{"label":"Video","url":"https://videos.ijcai20.org/25087/file_25087.m3u8","length_sec":300,"provider":"hls"}],"references":[{"position":1,"raw":"[Aldowaisan, 2001] Tariq Aldowaisan. A new heuristic and dominance relations for no-wait flowshops with setups. Computers & Operations Research, 28(6):563-584, 2001.","title":"A new heuristic and dominance relations for no-wait flowshops with setups","authors":"Tariq Aldowaisan","year":"2001","venue":"Computers & Operations Research","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Beldiceanu et al., 2010] Nicolas Beldiceanu, Mats Carls- son, and Jean-Xavier Rampon. Global constraint catalog, 2010.","title":"Nicolas Beldiceanu, Mats Carlsson","authors":"Beldiceanu","year":"2010","venue":null,"doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Chu and Stuckey, 2012] Geoffrey Chu and Peter J Stuckey. A generic method for identifying and exploiting domi- nance relations. In Principles and Practice of Constraint Programming, pages 6-22, 2012.","title":"A generic method for identifying and exploiting domi-nance relations","authors":"Geoffrey Chu, Peter J Stuckey","year":"2012","venue":"Principles and Practice of Constraint Programming","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Gange and Stuckey, 2018] Graeme Gange and Peter J Stuckey. Sequential precede chain for value symmetry elimination. In International Conference on Principles and Practice of Constraint Programming, pages 144-159. Springer, 2018.","title":"Sequential precede chain for value symmetry elimination","authors":"Graeme Gange, Peter J Stuckey","year":"2018","venue":"International Conference on Principles and Practice of Constraint Programming","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Getoor et al., 1997] Lise Getoor, Greger Ottosson, Markus Fromherz, and Björn Carlson. Effective redundant con- straints for online scheduling. In The Eleventh AAAI Con- ference on Artificial Intelligence, pages 302-307, 1997.","title":"Effective redundant constraints for online scheduling","authors":"Lise Getoor, Greger Ottosson, Markus Fromherz, Björn Carlson","year":"1997","venue":"The Eleventh AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Ibaraki, 1977] Toshihide Ibaraki. The power of dominance relations in branch-and-bound algorithms. Journal of the ACM (JACM), 24(2):264-279, 1977.","title":"Toshihide Ibaraki. The power of dominance relations in branch-and-bound algorithms","authors":"Ibaraki","year":"1977","venue":"Journal of the ACM (JACM)","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Katsirelos and Bacchus, 2005] George Katsirelos and Fahiem Bacchus. Generalized nogoods in CSPs. In The Nineteenth AAAI Conference on Artificial Intelligence, pages 390-396, 2005.","title":"George Katsirelos and Fahiem Bacchus. Generalized nogoods in CSPs","authors":"Bacchus Katsirelos","year":"2005","venue":"The Nineteenth AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Korf, 2004] Richard E Korf. Optimal rectangle packing: New results. In The Fourteenth International Conference on Automated Planning and Scheduling, pages 142-149, 2004.","title":"Optimal rectangle packing: New results","authors":"Richard E Korf","year":"2004","venue":"The Fourteenth International Conference on Automated Planning and Scheduling","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Land and Doig, 1960] AH Land and AG Doig. An auto- matic method of solving discrete programming problems. Econometrica: Journal of the Econometric Society, pages 497-520, 1960.","title":"AH Land and AG Doig. An automatic method of solving discrete programming problems","authors":"Doig Land","year":"1960","venue":"Econometrica: Journal of the Econometric Society","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Mears and de la Banda, 2015] Christopher Mears and Maria Garcia de la Banda. Towards automatic domi- nance breaking for constraint optimization problems. In Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015.","title":"Towards automatic dominance breaking for constraint optimization problems","authors":"De Mears, Christopher La Banda ;, Maria Mears, Garcia De La Banda","year":"2015","venue":"Twenty-Fourth International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2015/57"},{"position":11,"raw":"[Monette et al., 2007] Jean-Noël Monette, Pierre Schaus, Stéphane Zampelli, Yves Deville, Pierre Dupont, et al. A cp approach to the balanced academic curriculum prob- lem. In Seventh International Workshop on Symmetry and Constraint Satisfaction Problems, volume 7, 2007.","title":"A cp approach to the balanced academic curriculum problem","authors":"Jean-Noël Monette, Pierre Schaus, Stéphane Zampelli, Yves Deville, Pierre Dupont","year":"2007","venue":"Seventh International Workshop on Symmetry and Constraint Satisfaction Problems","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Nethercote et al., 2007] Nicholas Nethercote, Peter J Stuckey, Ralph Becket, Sebastian Brand, Gregory J Duck, and Guido Tack. Minizinc: Towards a standard CP modelling language. In International Conference on Principles and Practice of Constraint Programming, pages 529-543. Springer, 2007.","title":"Minizinc: Towards a standard CP modelling language","authors":"Nicholas Nethercote, J Peter, Ralph Stuckey, Sebastian Becket, Gregory J Brand, Guido Duck, Tack","year":"2007","venue":"International Conference on Principles and Practice of Constraint Programming","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Ohrimenko et al., 2009] Olga Ohrimenko, Peter J Stuckey, and Michael Codish. Propagation via lazy clause genera- tion. Constraints, 14(3):357-391, 2009.","title":"Propagation via lazy clause generation","authors":"Olga Ohrimenko, Peter J Stuckey, Michael Codish","year":"2009","venue":"Constraints","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Prestwich and Beck, 2004] Steven Prestwich and J Christo- pher Beck. Exploiting dominance in three symmetric problems. In Fourth international workshop on symmetry and constraint satisfaction problems, pages 63-70, 2004.","title":"Exploiting dominance in three symmetric problems","authors":"Steven Prestwich, J Christopher, Beck","year":"2004","venue":"Fourth international workshop on symmetry and constraint satisfaction problems","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Régin, 1994] Jean-Charles Régin. A filtering algorithm for constraints of difference in CSPs. In The Eighth AAAI Conference on Artificial Intelligence, pages 362- 367, 1994.","title":"A filtering algorithm for constraints of difference in CSPs","authors":"Jean-Charles Régin","year":"1994","venue":"The Eighth AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Yamada et al., 2002] Takeo Yamada, Seija Kataoka, and Kohtaro Watanabe. Heuristic and exact algorithms for the disjunctively constrained knapsack problem. Information Processing Society of Japan Journal, 43(9), 2002.","title":"Heuristic and exact algorithms for the disjunctively constrained knapsack problem","authors":"Yamada","year":"2002","venue":"Information Processing Society of Japan Journal","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}