Solving hard combinatorial problems with GSAT - A case study

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

Volumn 1137, Issue , 1996, Pages 107-119

  Hoos, Holger H ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; GRAPH THEORY;

COMBINATORIAL PROBLEM; EMPIRICAL ANALYSIS; HAMILTONIAN CIRCUITS; POOR PERFORMANCE; PROBLEM INSTANCES; PROPOSITIONAL SATISFIABILITY PROBLEMS; STRUCTURED PROBLEMS; TRANSFORMATION METHODS;

PROBLEM SOLVING;

EID: 84956990680     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61708-6_53     Document Type: Conference Paper

References (15)

1. A. Beringer, G. Aschemann, H.H. Hoos, M. Metzger, and A. Weiß GSAT versus Simulated Annealing. In A. G. Cohn, editor, Proceedings of the European Conference on Artificial Intelligence, pages 130-134. John Wiley & Sons, 1994.
2. N. Boissin and J.-L. Lutton. A parallel simulated annealing algorithm. Parallel Computing, 19:859-872, 1993.
3. Byungki Cha and Kazuo Iwama. Performance test of local search algorithms using new types of random CNF formulas. In Proceedings of the International Joint Conference on Artificial Intelligence, pages 304-310, 1995.
4. J.M. Crawford and L.D. Auton. Experimental results on the crossover point in satisfiability problems. In Proceedings of the AAAI National Conference on Artificial Intelligence, pages 21-27. MIT press, 1993.
5. Inn P. Gent and Toby Walsh. An empirical analysis of search in gsat. (Electronic) Journal of Artificial Intelligence Research, 1:47-59, 1993.
6. Inn P. Gent and Toby Walsh. Towards an understanding of hill-climbing procedures for SAT. In Proceedings of the AAAI National Conference on Artificial Intelligence, pages 28-33. MIT press, 1993.
7. Kazuo Iwama and Shuichi Miyazaki. SAT-variable complexity of hard combinatorial problems. In Proceedings of the World Computer Congress of the IFIP, pages 253-258 (Volume 1). Elsevier Science B.V., North Holland, 1994.
8. Kalev Kask and Rina Dechter. SAT and local consistency. In Proceedings of the International Joint Conference on Artificial Intelligence, pages 612-622, 1995.
9. Kurt Konolige. Easy to be hard: difficult problems for greedy algorithms. In Proceedings of the International Conference on Principles of Knowlege Representation and Reasoning, pages 374-378, 1994.
10. Karl Rüdiger Reischuk. Einführung in die Komplexitätstheorie. Teubner Verlag, Stuttgart, 1990.
11. Bart Selman and Henry A. Kautz. Domain-independent extensions to GSAT: Solving large structured satisfiability problems. In R. Bajcsy, editor, Proceedings of the International Joint Conference on Artificial Intelligence, volume 1, pages 290-295. Morgan Kaufmarm Publishers Inc., 1993.
12. Bart Selman and Henry A. Kautz. An empirical study of greedy local search for satisfiability testing. In Proceedings of the AAAI National Conference on Artificial Intelligence, pages 46-51. MIT press, 1993.
13. Bart Selman, Henry A. Kautz, and B. Cohen. Local search strategies for satisfiabiliy testing. Technical report, AT&T Bell Laboratories, Murray Hill, N J, 1993.
14. Bart Selman, H. Levesque, and D. Mitchell. A new method for solving hard satisfiability problems. In Proceedings of the AAAI National Conference on Artificial Intelligence, pages 440-446. MIT press, 1992.
15. W.M. Spears. Simulated Annealing for hard satisfiability problems. Technical report, Naval Research Laboratory, Washington D.C., 1993.