Maximum satisfiability: How good are tabu search and plateau moves in the worst-case?

European Journal of Operational Research

Volumn 166, Issue 1 SPEC. ISS., 2005, Pages 63-76

  Mastrolilli, Monaldo ^a   Gambardella, Luca Maria ^a  

^a DALLE MOLLE INSTITUTE FOR ARTIFICIAL INTELLIGENCE IDSIA   (Switzerland)

Author keywords

Local search; Maximum satisfiability; Tabu search; Worst case analysis

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; FORMAL LOGIC; KINETIC THEORY; ONLINE SEARCHING; OPTIMIZATION;

LOCAL SEARCH; MAXIMUM SATISFIABILITY; TABU SEARCH; WORST-CASE ANALYSIS;

PROBLEM SOLVING;

EID: 13544276227     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2003.01.005     Document Type: Article

References (23)

1. T. Asano, and D.P. Williamson Improved approximation algorithms for MAX SAT Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms 2000 ACM Press 96 105
2. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi Complexity and Approximation 1999 Springer
3. R. Battiti, and M. Protasi Reactive search, a history-sensitive heuristic for MAX-SAT ACM Journal of Experimental Algorithms 2 Article 2 1997
4. R. Battiti, and M. Protasi Approximate algorithms and heuristics for MaxSat D.-Z. Du P.M. Pardalos Handbook of Combinatorial Optimization vol. 1 1998 Kluwer Academic Publishers Dordrecht 77 148
5. R. Battiti, and G. Tecchiolli The reactive tabu search ORSA Journal on Computing 6 1994 126 140
6. M. Dell'Amico, and M. Trubian Applying tabu-search to the job shop scheduling problem Annals of Operations Research 22 1993 15 24
7. M.R. Garey, and D.S. Johnson Computers and Intractability; A Guide to the Theory of NP-Completeness 1979 W.H. Freeman
8. F. Glover Future paths for integer programming and links to artificial intelligence Computers and Operations Research 13 1986 533 549
9. F. Glover Tabu search - Part I ORSA Journal on Computing 1 3 1989 190 206
10. F. Glover Tabu search - Part II ORSA Journal on Computing 2 1 1990 4 32
11. M.X. Goemans, and D.P. Williamson New 3/4-approximation algorithms for MAX SAT SIAM Journal on Discrete Mathematics 7 1994 656 666
12. M.X. Goemans, and D.P. Williamson Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming Journal of the Association for Computing Machinery 42 1995 1115 1145
13. P. Hansen, and B. Jaumard Algorithms for the maximum satisfiability problem Computing 44 1990 279 303
14. H.H. Hoos On the run-time behaviour of stochastic local search algorithms for SAT Proceedings of the 6th National Conference on Artificial Intelligence (AAAI-99); Proceedings of the 11th Conference on Innovative Applications of Artificial Intelligence 1999 AAAI/MIT Press pp. 661-666
15. S. Khanna, R. Motwani, M. Sudan, U. Vazirani, On syntactic versus computational views of approximability, in: Proceedings: 35th Annual Symposium on Foundations of Computer Science, 1994, pp. 819-830
16. M. Mastrolilli, and L.M. Gambardella Effective neighbourhood functions for the flexible job shop problem Journal of Scheduling 3 2000 3 20
17. B. Mazure, L. Saïs, and É. Grégoire Tabu search for SAT Proceedings of the 14th National Conference on Artificial Intelligence and 9th Innovative Applications of Artificial Intelligence Conference (AAAI-97/IAAI-97) 1997 AAAI Press pp. 281-285
18. P. Mills, and E. Tsang Guided local search for solving SAT and weighted MAX-SAT problems JAR: Journal of Automated Reasoning 24 2000 205 223
19. B. Selman, H.A. Kautz, B. Cohen, Local search strategies for satisfiability testing, in: M. Trick, D.S. Johnson (Eds.), Proceedings of the Second DIMACS, Challenge on Cliques, Coloring, and Satisfiability, 1993
20. B. Selman, H.J. Levesque, and D. Mitchell A new method for solving hard satisfiability problems P. Rosenbloom P. Szolovits Proceedings of the Tenth National Conference on Artificial Intelligence 1992 AAAI Press 440 446
21. K. Smyth, H.H. Hoos, T. Stuetzle, Iterated robust tabu search for MAX-SAT, in: Proceedings of the 16th Canadian Conference on Artificial Intelligence (AI'2003), LNCS 2671, 2003, pp. 661-666
22. Z. Wu, and B.W. Wah An efficient global-search strategy in discrete lagrangian methods for solving hard satisfiability problems Proceedings of the 7th Conference on Artificial Intelligence (AAAI-00) and of the 12th Conference on Innovative Applications of Artificial Intelligence (IAAI-00) 2000 AAAI Press pp. 310-315
23. M. Yannakakis On the approximation of maximum satisfiability Journal of Algorithms 17 3 1994 475 502