Cluster-Specific Heuristics for Constraint Solving

Seda Polat Erdeniz, Alexander Felfernig, Müslüm Atas, Thi Ngoc Trang Tran, Michael Jeran, Martin Stettinger

Research output: Chapter in Book/Report/Conference proceedingConference paperpeer-review


In Constraint Satisfaction Problems (CSP), variable ordering heuristics help to increase efficiency. Applying an appropriate heuristic can increase the performance of CSP solvers. On the other hand, if we apply specific heuristics for similar CSPs, CSP solver performance could be further improved. Similar CSPs can be grouped into same clusters. For each cluster, appropriate heuristics can be found by applying a local search. Thus, when a new CSP is created, the corresponding cluster can be found and the pre-calculated heuristics for the cluster can be applied. In this paper, we propose a new method for constraint solving which is called Cluster Specific Heuristic (CSH). We present and evaluate our method on the basis of example CSPs.
Translated title of the contributionCluster-Specific Heuristics for Constraint Solving
Original languageEnglish
Title of host publicationAdvances in Artificial Intelligence: From Theory to Practice. IEA/AIE 2017
Place of PublicationCham
Number of pages10
ISBN (Print)978-3-319-60041-3
Publication statusPublished - 15 Jul 2017

Publication series

NameLecture Notes in Computer Science


Dive into the research topics of 'Cluster-Specific Heuristics for Constraint Solving'. Together they form a unique fingerprint.

Cite this