论文信息 - Conflict-based Statistics

Conflict-based Statistics

Conflict-based statistics is presented as a new general heuristics which can be applied for value ordering. It is shown how to apply it within iterative forward search algorithm and local search algorithms. Experimental results for combination of local search with conflict-based statistics are presented.

[1] Dr. Zbigniew Michalewicz,et al. How to Solve It: Modern Heuristics , 2004 .

[2] Narendra Jussien,et al. Local search with constraint propagation and conflict-based heuristics , 2000, Artif. Intell..

[3] Rina Dechter,et al. Backjump-based backtracking for constraint satisfaction problems , 2002, Artif. Intell..

[4] Roman Barták,et al. Minimal Perturbation Problem in Course Timetabling , 2004, PATAT.

[5] Steven Minton,et al. Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..

[6] Jin-Kao Hao,et al. Tabu Search for Maximal Constraint Satisfaction Problems , 1997, CP.