Towards Automatic Dominance Breaking for Constraint Optimization Problems
| 
71 | 
57 | 
0
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.
还没有评论，说两句吧！
热门资源
The Variational S...
Unlike traditional images which do not offer in...
Learning to Predi...
Much of model-based reinforcement learning invo...
Stratified Strate...
In this paper we introduce Stratified Strategy ...
A Mathematical Mo...
Direct democracy, where each voter casts one vo...
Rating-Boosted La...
The performance of a recommendation system reli...
智能在线
400-630-6780
聆听.建议反馈
E-mail: support@tusaishared.com
资源分类
