In this paper we show, for the specific problem of test pattern optimisation, that adapting constraint propagation with results obtained from local search outperforms the use of each of these techniques alone. We show that a tool we developed to solve this problem using such approach with multivalued logics achieves better results than those obtained with a highly efficient tool based on an integer linear programming formulation over a SAT model.
CITATION STYLE
Azevedo, F., & Barahona, P. (2001). Interaction of constraint programming and local search for optimisation problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2239, pp. 554–559). Springer Verlag. https://doi.org/10.1007/3-540-45578-7_38
Mendeley helps you to discover research relevant for your work.