Reactive Search, a history-sensitive heuristic for MAX-SAT

ACM Journal of Experimental Algorithmics

Volumn 2, Issue , 1997, Pages 2-

  Battiti, Roberto ^a   Protasi, Marco ^b  

^a UNIVERSITY OF TRENTO   (Italy)

^b UNIVERSITY OF ROME TOR VERGATA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84948952917     PISSN: 10846654     EISSN: 10846654     Source Type: Journal    
DOI: 10.1145/264216.264220     Document Type: Article

References (34)

1. E. H. L. Aarts, J.H.M. Korst, and P.J. Zwietering, “Deterministic and randomized local search,” in Mathematical Perspectives on Neural Networks, edited by M. Mozer P. Smolensky and D. Rumelhart (Hillsdale, NJ:Lawrence Erlbaum Publishers, to appear).
2. A. V. Aho, D. S. Johnson, R. M. Karp, S. R. Kosaraju, C. C. McGeoch, C. H. Papadimitriou, and P. Pevzner, “Theory of Computing: Goals and Directions,” University of Washington Tech. Rep. CSE-93-03, to appear in Computing Surveys.
3. P. Alimonti, “ New local search approximation techniques for maximum generalized satisfiability problems,” Proceedings Second Italian Conf. on Algorithms and Complexity, (1994), 40-53.
4. G. Ausiello, P. Crescenzi, and M. Protasi, “Approximate solution of NP optimization problems,” Theoretical Computer Science 150 (1995), 1-55.
5. R. S. Barr, B. L. Golden, J. P. Kelly, M. G. C. Resende, and W. Stewart, “Designing and Reporting on Computational Experiments with Heuristic Methods,” Journal of Heuristics 1(1) (1996), 9-32.
6. R. Battiti, “Reactive Search: Toward Self-Tuning Heuristics,” in Modern Heuristic Search Methods, edited by V. J. Rayward-Smith, I. H. Osman, C. R. Reeves, and G. D. Smith (John Wiley and Sons Ltd, 1996), 61-83.
7. R. Battiti and M. Protasi, “Solving MAX-SAT with non-oblivious functions and history-based heuristics,” DIMACS Workshop on Satisfiability, March 11-13, 1996, Rutgers University.
8. R. Battiti and M. Protasi, “Reactive local search for the Maximum Clique problem,” Tech. Rept. TR-95-052, International Computer Science Institute, Berkeley, CA, 1995.
9. R. Battiti and G. Tecchiolli, “The reactive tabu search,” ORSA Journal on Computing 6(2) (1994), 126140.
10. I.P. Gent and T. Walsh, “Towards an understanding of hill-climbing procedures for SAT,” Preprint, 1993.
11. F. Glover, “Tabu search - part I,” ORSA Journal on Computing 1(3) (1989), 190-260.
12. M. K. Goldberg and D. L. Hollinger, “Learning Better Algorithms for the Maximum Clique Problem,” Tech. Report, Rensselaer Polytechnic Institute, Jan 1996.
13. J. Gu, “Parallel Algorithms and Architectures for very fast AI Search,” PhD thesis, LJniversity of LJtah.
14. J. Gu, “Efficient local search for very large-scale satisfiability problem,” ACM SIGART Bulletin 3(1) (1992), 8-12.
15. J. Gu, P. W. Purdom, J. Franco, and B.W. Wall, “Algorithms for the Satisfiability (SAT) Problem: a Survey,” Preliminary version, 1996.
16. D.S. Johnson, “Approximation algorithms for combinatorial problems,” J. of Computer and System Sciences 9 (1974), 256-278.
17. 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 (1991), 378-406.
18. T. Hagerup and C. Rüb, “A guided tour of Chernoff bounds,” Information Processing Letters 33 (1989/90), 305-308.
19. P. Hansen and B. Jaumard, “Algorithms for the maximum satisfiability problem,” Computing 44 (1990), 279-303.
20. J. Holland, Adaptation in Natural and Artificial Systems. (Ann Arbor, MI: Unive)
21. J. Hooker, “Testing Heuristics: We Have it All Wrong,” Journal of Heuristics 1(1) (1996), 33-42.
22. S. Khanna, R. Motwani, M. Sudan, and U. Vazirani, “On syntactic versus computational views of approximability,” Proceedings 35th Ann. IEEE Symp. on Foundations of Computer Science, (1994), 819-836,.
23. L.-J. Lin, “Self-improving reactive agents based on reinforcement learning, planning and teaching,” Machine Learning Journal, Special Issue on Reinforcement Learning 8 (1992), 293-322.
24. S. Minton, M. D. Johnston, A. B. Philips, and P. Laird, “Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method,” Proceedings AAAI-90, (1990), 17-24.
25. S. Minton, “Automatically Configuring’ Constraint Satisfaction Programs: A Case Study,” Constraints, An International Journal 1 (1996), 7-43.
26. D. Mitchell, B. Selman, and H. Levesque, “Hard and easy distributions of sat problems,” Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI-92), San Jose, Ca (1992), 459-465.
27. P. Pardalos, “Continuous approaches to discrete optimization problems,” in Nonlinear optimization and applications, edited by G. Di Pillo and F. Giannessi, (Plenum Publishing, 1995).
28. B. Selman and H.A. Kautz, “An empirical study of greedy local search for satisfiability testing,” Proceedings of the eleventh national Conference on Artificial Intelligence (AAAI-93), Washington, D, C, 1993.
29. B. Selman and H. Kautz, “Noise strategies for improving local search,” Proceedings of AAAI-94, 1994.
30. B. Selman, H.A. Kautz, and B. Cohen, “Local search strategies for satisfiability testing,” Proceedings of the Second DIMACS Algorithm Implementation Challenge on Cliques, Coloring and Satisfiability, Oct. 1993, edited by M. Trick and D. S. Johnson, DIMACS Series on Discrete Mathematics and Theoretical Computer Science, to appear.
31. B. Selman, H. Levesque, and D. Mitchell, “A new method for solving hard satisfiability problems,” Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI-92), San Jose, Ca, (1992), 440-446.
32. S. Singh and D. Bertsekas, “Reinforcement Learning for Dynamic Channel Allocation in Cellular Telephone Systems,” Proceedings of NIPS96, in press.
33. I.P. Gent and T. Walsh, “An empirical analysis of search in GSAT,” Journal of Artificial Intelligence Research 1 (1993), 47-59.
34. L. G. Valiant, “A theory of the learnable,” Communications of the ACM 27(11) (1984), 1134-1142.