Analysis of heuristic methods for partial constraint satisfaction problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1118, Issue , 1996, Pages 482-496

  Wallace, Richard J ^a  

^a UNIVERSITY OF NEW HAMPSHIRE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957872184     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61551-2_95     Document Type: Conference Paper

References (15)

1. E. C. Freuder and R. J. Wallace. Partial constraint satisfaction. Artificial Intelligence, 58:21-70, 1992.
2. F. Glover. Tabu search: a tutorial. Interfaces, 20:74-94, 1990.
3. I. Gent and T. Walsh. The enigma of SAT hill-climbing procedures. Research Paper No. 605, University of Edinburgh, 1992.
4. I. Gent and T. Walsh. Towards an understanding off hill-climbing procedures for sat. In Proceedings AAAI-93, pages 28-33, 1993.
5. D. S. Johnson, C. R. Aragon, L. A. McGeoch, and C. Shevon. Optimization by simulated annealing: An experimental evaluation; part ii, graph coloring and number partitioning. Operations Research, 39:378-406, 1991.
6. K. Kask and R. Dechter. GSAT and local consistency. In Proceedings IJCAI-95, pages 616-622, 1995.
7. S. Minton, M. Johnston, A. Philips, and P. Laird. Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method. In Proceedings AAAI-90, pages 17-24, 1990.
8. S. Minton, M. D. Johnston, A. B. Philips, and P. Laird. Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 58:161-205, 1992.
9. P. Morris. The breakout method for escaping from local minima. In Proceedings AAAI-93, pages 40-45, 1993.
10. T. Schiex, H. Fargier, and G. Verfaillie. Valued constraint satisfaction problems: Hard and easy problems. In Proceedings IJCAI-95, pages 631-637, 1995.
11. B. Selman and H. A. Kautz. An empirical study of greedy local search for satisfiability testing. In Proceedings AAAI-93, pages 46-51, 1993.
12. B. Smith. Phase transition and the mushy region in constraint satisfaction problems. In Proceedings ECAI-94, pages 100-104, 1994.
13. R. J. Wallace. Directed arc consistency preprocessing as a strategy for maximal constraint satisfaction. In M. Meyer, editor, Constraint Processing, volume 923 of Lecture Notes in Computer Science, pages 121-138. Springer-Verlag, Heidelberg, 1995.
14. N. Yugami, Y. Ohta, and H. Hara. Improving repair-based constraint satisfaction methods by value propagation. In Proceedings AAAI-94, pages 344-349, 1994.
15. M. Yokoo. Weak-commitment search for solving constraint satisfaction problems. In Proceedings AAAI-94, pages 313-318, 1994.