Towards Automatic Dominance Breaking for Constraint Optimization Problems
Abstract
The exploitation of dominance relations in constraint optimization problems can lead to dramatic reductions in search space. We propose an automatic method to detect some of the dominance relations manually identified by Chu and Stuckey for optimization problems, and to construct the associated dominance breaking constraints. Experimental results show that the method is able to find several dominance relations and to generate effective dominance breaking constraints.
Cite
Text
Mears and de la Banda. "Towards Automatic Dominance Breaking for Constraint Optimization Problems." International Joint Conference on Artificial Intelligence, 2015.Markdown
[Mears and de la Banda. "Towards Automatic Dominance Breaking for Constraint Optimization Problems." International Joint Conference on Artificial Intelligence, 2015.](https://mlanthology.org/ijcai/2015/mears2015ijcai-automatic/)BibTeX
@inproceedings{mears2015ijcai-automatic,
title = {{Towards Automatic Dominance Breaking for Constraint Optimization Problems}},
author = {Mears, Christopher and de la Banda, Maria Garcia},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2015},
pages = {360-366},
url = {https://mlanthology.org/ijcai/2015/mears2015ijcai-automatic/}
}