资源分类
》 资源 》》Towards Automatic Dominance Breaking for Constraint Optimization Problems?

Towards Automatic Dominance Breaking for Constraint Optimization Problems?

2019-11-18 | |  41 |   1 |   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.

上一篇：Solving QBF by Clause Selection?

下一篇：On Constrained Boolean Pareto Optimization? Chao Qian and Yang Yu and Zhi-Hua Zhou

用户评价
全部评价

热门资源

  • Multi-Source Cros...

    Modern NLP applications have enjoyed a great bo...

  • Reference Network...

    Neural Machine Translation (NMT) has achieved n...

  • Soft Contextual D...

    While data augmentation is an important trick t...

  • Style Transformer...

    Disentangling the content and style in the lat...

  • Towards Fine-grai...

    In this paper, we focus on the task of finegra...