Bibliography

1

T. Bäck, A. Eiben, and M. Vink.
A superior evolutionary algorithm for 3-SAT.
In D. W. N. Saravanan and A. Eiben, editors, Proceedings of the 7th Annual Conference on Evolutionary Programming, Lecture Notes in Computer Science, pages 125-136. Springer, 1998.

2

R. Battiti and M. Protasi.
Approximate algorithms and heuristics for MAX-SAT.
In D.-Z. Du and P. Pardalos, editors, Handbook of Combinatorial Optimization, pages 77-148. Kluver Academic Publisher, 1998.

3

D. Du, J. Gu, and P. P. (Eds.).
Satisfiability Problem: Theory and Applications.
AMS, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol 35, 1997.

4

A. Eiben and J. van der Hauw.
Solving 3-SAT with adaptive Genetic Algorithms.
In Proceedings of the 4th IEEE Conference on Evolutionary Computation, pages 81-86. IEEE Press, 1997.

5

G.Folino, C.Pizzuti, and G.Spezzano.
Combining cellular genetic algorithms and local search for solving satisfiability problems.
In Proc. of ICTAI'98 10th IEEE International Conference Tools with Artificial Intelligence, pages 192-198. IEEE Computer Society, 1998.

6

F. Glover and D. D. Werra.
Tabu Search.
Vol.41, Baltzer Science, 1993.

7

J. Gottlieb and N. Voss.
Improving the performance of evolutionary algorithms for the satisfiability problem by refining functions.
In A. Eiben, T. Bäck, M. Schoenauer, and H.-P. Schwefel, editors, Proceedings of the Fifth International Conference on Parallel Problem Solving from Nature (PPSN V), LNCS 1498, pages 755 - 764. Springer, 1998.

8

E. Marchiori.
A simple heuristic based genetic algorithm for the maximum clique problem.
In J. C. et al., editor, ACM Symposium on Applied Computing, pages 366-373. ACM Press, 1998.

9

E. Marchiori and C. Rossi.
A flipping genetic algorithm for hard 3-SAT problems.
In Genetic and Evolutionary Computation Conference, 1999.

10

P. Merz and B. Freisleben.
Genetic local search for the TSP: New results.
In IEEE International Conference on Evolutionary Computation, pages 159-164. IEEE Press, 1997.

11

M. Resende and T. Feo.
A GRASP for satisfiability.
In D. Johnson and M. Trick, editors, Cliques, Coloring and Satisfiability, pages 499-520. AMS, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol 26, 1996.

12

B. Selman, H. Levesque, and D. Mitchell.
A new method for solving hard satisfiability problems.
In Proceedings of the 10th National Conference on Artificial Intelligence, AAAI-92, pages 440-446. AAAI Press/The MIT Press, 1992.