Search space features underlying the performance of stochastic local search algorithms for MAX-SAT

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

Volumn 3242, Issue , 2004, Pages 51-60

  Hoos, Holger H ^a   Smyth, Kevin ^a   Stützle, Thomas ^b  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOCORRELATION; EVOLUTIONARY ALGORITHMS; LOCAL SEARCH (OPTIMIZATION); OPTIMIZATION; SIMULATED ANNEALING; STOCHASTIC SYSTEMS; TABU SEARCH;

AUTOCORRELATION LENGTH; FITNESS-DISTANCE CORRELATION; GENERALISATION; OPTIMISATION PROBLEMS; PROPOSITIONAL SATISFIABILITY PROBLEMS; SEARCH STRATEGIES; STOCHASTIC LOCAL SEARCHES; WEIGHT DISTRIBUTIONS;

PROBLEM SOLVING;

EID: 35048868311     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30217-9_6     Document Type: Article

References (22)

1. Gu, J., Puri, R.: Asynchronous circuit synthesis with boolean satisfiability. IEEE Transactions on Computer-Aided Design of Integrated Circuits 14 (1995) 961-973
2. Kamath, A., Karmarkar, N., Ramakrishnan, K., Resende, M.: A continuous approach to inductive inference. Mathematical Programming 57 (1992) 215-238
3. Asirelli, P., de Santis, M., Martelli, A.: Integrity constraints in logic databases. J. of Logic Programming 3 (1985) 221-232
4. Hoos, H., Stützle, T.: Stochastic Local Search - Foundations and Applications. Morgan Kaufmann Publishers, USA (2004 (to appear))
5. Smyth, K., Hoos, H.H., Stützle, T.: Iterated robust tabu search for MAX-SAT. In Xiang, Y., Chaib-draa, B., eds.: Advances in Artificial Intelligence. Volume 2671 of LNCS., Springer Verlag, Germany (2003) 129-144
6. Weinberger, E.: Correlated and uncorrelated fitness landscapes and how to tell the difference. Biol. Cyber. 63 (1990) 325-336
7. Stadler, P.F.: Towards a theory of landscapes. In et al., R.L., ed.: Complex Systems and Binary Networks. Volume 461 of Lecture Notes in Physics., Springer Verlag, Berlin, Germany (1995) 77-163
8. Stadler, P., Happel, R.: Random field models for fitness landscapes. Journal of Mathematical Biology 38 (1999) 435-478
9. Jones, T., Forrest, S.: Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms. In: Proceedings of ICGA'95, Morgan Kauffman (1995) 184-192
10. Angel, E., Zissimopoulos, V: On the classification of NP-complete problems in terms of their correlation coefficient. Discrete Applied Mathematics 99 (2000) 261-277
11. Merz, P., Freisleben, B.: Fitness landscapes and memetic algorithm design. In Corne, D., Dorigo, M., Glover, F., eds.: New Ideas in Optimization. McGraw-Hill (1999)
12. Merz, P., Freisleben, B.: Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE Transact. on Evol. Comput. 4 (2000) 337-352
13. Hansen, P., Jaumard, B.: Algorithms for the maximum satisfiability problem. Computing 44 (1990) 279-303
14. Selman, B., Kautz, H., Cohen, B.: Noise strategies for improving local search. In: Proc. of the 12th Natl. Conf. on Artificial Intelligence, MIT Press (1994) 337-343
15. Resende, M., Pitsoulis, L., Pardalos, P.: Approximate solution of weighted MAX-SAT problems using GRASP. In Du, D., Gu, J., Pardalos, P., eds.: Satisfiability problem: Theory and Applications. Volume 35. AMS (1997) 393-405
16. Wu, Z., Wah, B.: Trap escaping strategies in discrete lagrangian methods for solving hard satisfiability and maximum satisfiability problems. In: Proc. of AAAI'99, MIT Press (1999) 673-678
17. Mills, P., Tsang, E.: Guided local search for solving SAT and weighted MAX-SAT problems. In Gent, I., van Maaren, H., Walsh, T., eds.: SAT2000 - Highlights of Satisfiability Research in the Year 2000. IOS Press (2000) 89-106
18. Jiang, Y., Kautz, H., Selman, B.: Solving problems with hard and soft constraints using a stochastic algorithm for MAX-SAT. In: Proceedings of the 1st International Joint Workshop on Artificial Intelligence and Operations Research. (1995)
19. Zlochin, M., Dorigo, M.: Model-based search for combinatorial optimization: A comparative study. In Merelo, J.J., et al., eds.: Proceedings of PPSN-VII. Volume 2439 of LNCS., Springer Verlag, Germany (2002) 651-661
20. Mitchell, D., Selman, B., Levesque, H.: Hard and easy distributions of SAT problems. In: Proc. of AAAI'92, MIT Press (1992) 459-465
21. Hoos, H., Stützle, T.: Characterising the behaviour of stochastic local search. Artificial Intelligence 112 (1999) 213-232
22. Clark, D., Frank, J., Gent, I., MacIntyre, E., Tomov, N., Walsh, T.: Local search and the number of solutions. In Freuder, E., ed.: Proc. of CP'96. Volume 1118 of LNCS., Springer Verlag, Germany (1996) 119-133