Heuristic methods for over-constrained constraint satisfaction problems

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

Volumn 1106, Issue , 1996, Pages 207-216

  Wallace, Richard J ^a   Freuder, Eugene C ^a  

^a UNIVERSITY OF NEW HAMPSHIRE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; EFFICIENCY; HEURISTIC ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION;

CONSTRAINT VIOLATION; HEURISTIC REPAIR METHODS; OPTIMAL SOLUTIONS; OVER-CONSTRAINED; QUALITY OF SOLUTION; RANDOM ASSIGNMENT; SATISFIABILITY PROBLEMS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84947431468     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61479-6_23     Document Type: Conference Paper

References (6)

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. 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.
4. B. Selman and H. A. Kautz. An empirical study of greedy local search for satisfiability testing. In Proceedings AAAI-93, pages 46-51, 1993.
5. B. Selman, H. Levesque, and D. Mitchell. A new method for solving hard satisfiability problems. In Proceedings AAAI-92, pages 440-446, 1992.
6. R. J. Wallace and E. G. Freuder. Comparing constraint satisfaction and Davis-Putnam algorithms for the maximal satisfiability problem. In D. S. Johnson and M. A. Trick, editors, Cliques, Coloring and Satisfiability: Second DIM ACS Implementation Challenge, (to appear). Amer. Math. Soc., 1996.