Efficient initial solution to extremal optimization algorithm for weighted MAXSAT problem

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2718, Issue , 2003, Pages 592-603

  Menai, Mohamed El Bachir ^a   Batouche, Mohamed ^b  

^a UNIVERSITY OF TEBESSA   (Algeria)

^b Universite Mentouri Constantine   (Algeria)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; EXPERT SYSTEMS; HEURISTIC ALGORITHMS; HEURISTIC METHODS; STATISTICAL MECHANICS; STOCHASTIC SYSTEMS; APPROXIMATION THEORY; OPTIMIZATION; PROBLEM SOLVING; RANDOM PROCESSES;

APPROXIMATED SOLUTIONS; BOSE-EINSTEIN DISTRIBUTION; COMBINATORIAL PROBLEM; COMPUTATIONAL EXPERIMENT; HIGH-QUALITY SOLUTIONS; META-HEURISTIC METHODS; STOCHASTIC LOCAL SEARCHES; WEIGHTED MAXIMUM SATISFIABILITY;

OPTIMIZATION; ALGORITHMS;

BOSE-EINSTEIN DISTRIBUTION; EXTREMAL OPTIMIZATION ALGORITHM; META-HEURISTIC METHOD; STOCHSTICAL LOCAL SEARCH ALGORITHMS;

EID: 7044261988     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-45034-3_60     Document Type: Conference Paper

References (26)

1. Bak, P., Tang, C., Wiesenfeld, K.: Self-organized Criticality: An Explanation of 1/f-noise. Physical Review Letters, V86 N23. (1987) 5211-5214
2. Bak, P., Sneppen, K.: Punctuated Equilibrium and Criticality in a Simple Model of Evolution. Physical Review letters, 59. (1993) 381-384
3. Battiti, R., Protasi, M.: Reactive Search, a History-Sensitive Heuristic for MAX-SAT. ACM Journal of Experimental Algorithmics, Vol. 2, Paper 2 (1997)
4. Boettcher, S., Percus, A. G.: Nature's Way of Optimizing. Elsevier Science, Artificial Intelligence, 119. (2000) 275-286
5. Boettcher, S., Percus, A. G.: Optimization with Extremal Dynamics. Physical Review Letters, V86 N23. (2001a) 5211-5214
6. Boettcher, S., Percus, A. G.: Extremal Optimization for Graph Partitioning. Physical Review E, V64 026114. (2001b) 1-13
7. Cook, S. A.: The Complexity of Theorem Proving Procedures. Proceedings of the 3rd Annual ACM Symposium of the Theory of Computation. (1971) 263-268
8. Dorigo, M., Maniezzo, V., Colorni, A.: The Ant System: Optimization by a Colony of Cooperating Agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B, Vol. 26, N1. (1996) 1-13
9. Gent, I. P., Walsh, T.: Towards an Understanding of Hill-Climbing Procedures for SAT. Proceedings of the 11th National Conference on Artificial Intelligence. (1993) 28-33
10. Glover, F.: Tabu Search: Part I. ORSA Journal on Computing 1 (3). (1989a) 190-206
11. Glover, F.: Tabu Search: Part II. ORSA Journal on Computing 2 (1). (1989a) +32
12. Hansen, P., Jaumard, B.: Algorithms for the Maximum Satisfiability Problems. Computing, 44. (1990) 279-303
13. Johnson, D.: Approximation Algorithms for Combinatorial Problems. Journal of Computer and System Sciences, 9. (1974) 256-278
14. Kirkpatrick, S., Gelatt, C. D., Vecchi, P. M.: Optimization by Simulated Annealing. Science, 220. (1983) 671-680
15. Mazure, B., Sais, L., Gregoire, E.: Tabu Search for SAT. Proceedings of the 14th National Conference on Artificial Intelligence and 9th Innovative Applications of Artificial Intelligence Conference. (1997) 281-285
16. McAllester, D., Selman, B., Kautz, H. A.: Evidence for Invariants in Local Search. Proceedings of AAAI'92. MIT Press (1997) 321-326
17. Menai, M. B., Batouche, M.: Extremal Optimization for MAXSAT. Proceedings of the International Conference on Artificial Intelligence (IC-AI'02), Las Vegas, USA. 954-958
18. Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., Teller, E.: Equation of state calculations by fast computing machines. Journal of Chemical Physics, 21. (1953) 1087-1092
19. Resende, M. G. C., Pitsoulis, L. S., Pardalos, P. M.: Approximate Solution of Weighted MAX-SAT Problems using GRASP. in Satisfiability Problem: Theory and Applications, Vol. 35 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science (American Mathematical Society, 1997). (1997) 393-405
20. Ross, M. S.: Introduction to Probability Models. Academic Press, New York. (2000) 137-141
21. Selman, B., Kautz, H. A.: An Empirical Study of Greedy Local Search for Satisfiability Testing. Proceedings of the 11th National Conference on Artificial Intelligence. (1993a) 46-51
22. Selman, B., Kautz, H. A.: Domain Independent Extensions to GSAT: Solving Large Structured Satisfiability Problems. Proceedings of the 13th International Joint Conference on Artificial Intelligence. (1993b) 290-295
23. Selman, B., Kautz, H. A., Cohen B.: Noise Strategies for Improving Local Search. Proceedings of the 12th National Conference on Artificial Intelligence. (1994) 337-343
24. Spears, W. M.: Simulated Annealing for Hard Satisfiability Problems. In D. S. Johnson and M. A. Trick (eds.), Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge, Vol. 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science (American Mathematical Society, 1996). (1996) 553-558
25. Szedmak, S.: How to Find More Efficient Initial Solution for Searching ? RUT-COR Research Report, 49-2001, Rutgers Center for Operations Research, Rutgers University. (2001)
26. Yagiura, M., Ibaraki, T.: Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT: Experimental Evaluation. Journal of Heuristics, 7. (2001) 423-442