Tabu search vs random walk

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

Volumn 1303, Issue , 1997, Pages 337-348

  Strohmaler, Antje ^b   Stüitzle, Thomas ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

^b DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BENCHMARKING; RANDOM PROCESSES; TABU SEARCH;

BENCHMARK TESTS; EXPERIMENTAL EVIDENCE; GRAPH COLORINGS; LOCAL SEARCH; RANDOM WALK; SATISFIABILITY;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84957027959     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3540634932_27     Document Type: Conference Paper

References (21)

1. H. Bennaceur. The Satisfiability Problem Regarded as a Constraint Satisfaction Problem. In Wolfgang Wahlster, editor, ECAI'96, pages 155-160. John Wiley & Sons, Chichester, 1996.
2. A. Davenport, E. Tsang, C.J. Wang, and K. Zhu. GENET: A Connectionist Architecture for Solving Constraint Satisfaction Problems by Iterative Improvement. In AAAI'94, 1994.
3. J. de Kleer. A Comparison of ATMS and CSP Techniques. In IJCAI'89. Morgan Kaufmann, 1989.
4. I. P. Gent and T. Walsh. Towards an understanding of hill-climbing procedures for SAT. In AAAI'93, pages 28-33. MIT press, 1993.
5. I.P. Gent and T. Walsh. An empirical analysis of search in GSAT. Journal of Artificial Intelligence Research, 1:47-59, 1993.
6. F. Glover. Tabu Search - Part I. ORSA Journal on Computing, 1(3):190-206, 1989.
7. P. Hansen and B. Jaumard. Algorithms for the Maximum Satisfiability Problem. Computing, 44:279-303, 1990.
8. H. H. Hoos. Solving hard combinatorial problems with GSAT - a case study. In KI-96, volume 1137 of LNAI, pages 107-119. Springer Verlag, 1996.
9. D.S. Johnson, C.R. Aragon, L.A. McGeoch, and C. Schevon. Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning. Operations Research, 39(3):378-406, 1991.
10. H. Kautz and B. Selman. Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search. In AAAI'96, volume 2, pages 1194-1201. MIT Press, 1996.
11. B. Mazure, L. Sais, and E. Gregoire. TWSAT: A New Local Search Algorithm for SAT - Performance and Analysis. In CP'95 Workshop on Solving Hard Problems, 1995.
12. 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, 52:161-205, 1992.
13. P. Morris. The Breakout Method for Escaping from Local Minima. In AAAI'93, pages 40-45, 1993.
14. B. Selman and Henry A. Kautz. Domain-independent extensions to GSAT: Solving large structured satisfiability problems. In IJCAI'93, pages 290-295, 1993.
15. B. Selman, Henry A. Kautz, and Bram Cohen. Noise Strategies for Improving Local Search. In AAAI'94, pages 337-343. MIT press, 1994.
16. B. Selman, H. Levesque, and D. Mitchell. A New Method for Solving Hard Satis-fiability Problems. In AAAI'92, pages 440-446. MIT press, 1992.
17. Bart Selman, David G. Mitchell, and Hector J. Levesque. Generating Hard Satis-fiability Problems. Artificial Intelligence, 81(1-2):17-30, 1996.
18. B.M. Smith. Phase Transitions and the Mushy Region in Constraint Satisfaction Problems. In ECAI'94, pages 100-104, 1994.
19. Olaf Steinmann. Kombinatorische Probleme, Optimierung and Parallelisierung: Eine experimentelle Analyse von Multi-Flip-Netzwerken. Master's thesis, TH Darmstadt, FB Inforrnatik, FG Intellektik, 1997.
20. Richard J. Wallace. Analysis of Heuristic Methods for Partial Constraint Satisfaction Problems. In Constraint Programming 96, LNCS, pages 482-496. Springer Verlag, 1996.
21. R.J. Wallace and E. Freuder. Heuristic Methods for Over-Constrained Constraint Satisfaction Problems. In Over-Constrained Systems, volume 1106 of Lecture Notes in Computer Science. Springer Verlag, 1996.