GRASP with path relinking for the weighted MAXSAT problem

ACM Journal of Experimental Algorithmics

Volumn 11, Issue , 2006, Pages

  Festa, Paola ^a   Pardalos, Panos M ^b   Pitsoulis, Leonidas S ^c   Resende, Mauricio G C ^d  

^a UNIVERSITY OF NAPLES FEDERICO II   (Italy)

^b University of Florida   (United States)

^c ARISTOTLE UNIVERSITY OF THESSALONIKI   (Greece)

^d AT AND T LABS RESEARCH   (United States)

Author keywords

Algorithms; Experimentation; G.4 Mathematical Software : Algorithm Design and Analysis; GRASP; Heuristics; Path relinking; Performance; Time to target plots

Indexed keywords

EID: 46749110926     PISSN: 10846654     EISSN: None     Source Type: Journal    
DOI: 10.1145/1187436.1216581     Document Type: Article

References (35)

1. AIEX, R. M., BINATO, S., AND RESENDE, M. 2003. Parallel GRASP with path-relinking for job shop scheduling. Parallel Computing 29, 393-430.
2. AIEX, R. M., RESENDE,M. G. C.,PARDALOS, P. M., AND TORALDO, G. 2005. GRASP with path relinking for three-index assignment. INFORMS J. on Computing 17, 2, 224-247.
3. th IEEE Israel Symposium on the Theory of Computing and Systems. 24-37.
4. BATTITI, R. AND PROTASI, M. 1997. Reactive search, a history-sensitive heuristic for MAX-SAT. ACM Journal of Experimental Algorithms 2, 2.
5. BATTITI, R. AND PROTASI, M. 1998. Approximate algorithms and heuristics for the MAX-SAT. In Handbook of Combinatorial Optimization, D. Z. Du and P. M. Pardalos, Eds. vol. 1. Kluwer Academic Publ., Boston, MA. 77-148..
6. CANUTO, S. A., RESENDE, M. G. C., AND RIBEIRO, C. C. 2001. Local search with perturbations for the prize-collecting Steiner tree problem in graphs. Networks 38, 50-58.
7. th Annual IEEE Conference on Computational Complexity. 274-281.
8. COOK S. A. 1971. The complexity of theorem-proving procedures. In Proceedings of the Third Annual ACM Symposium on Theory of Computing. 151-158..
9. FEIGE, U. AND GOEMANS, M. X. 1995. Approximating the value of two proper proof systems, with applications to MAX-2SAT and MAX-DICUT. In Proceedings of the Third Israel Symposium on Theory of Computing and Systems. 182-189.
10. FEO, T. A. RESENDE, M. G. C., AND SMITH, S. H. 1994. A greedy randomized adaptive search procedure for maximum independent set. Operations Research 42, 860-878.
11. GAREY, M. R. AND JOHNSON, D. S. 1979. Computers and intractability: A guide to the theory of NP-completeness. Freeman, San Francisco, CA.
12. th National Conference on Artificial Intelligence. 28-33.
13. GLOVER, F. 1996. Tabu search and adaptive memory programming: Advances, applications and challenges. In Interfaces in Computer Science and Operations Research, R. S. Barr, R. V. Helgason, and J. L. Kennington, Eds. Kluwer Academic Publ. Boston, MA. 1-75.
14. GOEMANS, M. X. AND WILLIAMSON, D. P. 1994. A new 3/4 approximation algorithm for the maximum satisfiability problem. SIAM Journal on Discrete Mathematics 7, 656-666.
15. GOEMANS, M. X. AND WILLIAMSON, D. P. 1995. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of Association for Computing Machinery 42, 6, 1115-1145.
16. Hansen, P. and Jaumard, B. 1990. Algorithms for the maximum satisfiability problem. Computing 44, 279-303.
17. HART, J. P. AND SHOGAN, A. W. 1987. Semi greedy heuristics: An empirical study. Operations Research Letters 6, 107-114.
18. HASTAD, J. 2001. Some optimal inapproximability results. Journal of the ACM 48, 798-859.
19. JOHNSON,D. S. 1974. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences 9, 256-278.
20. JOHNSON, D. S., PAPADIMITRIOU, C. H., AND YANNAKAKIS, M. 1988. How easy is local search? Journal of Computer and System Sciences 37, 79-100.
21. JOHNSON, D. S. AND TRICK,M. A., EDS. 1996. Cliques, coloring, and Satisfiability: Second DIMACS Implementation Challenge. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society.
22. th Annual IEEE Symposium on Foundations of Computer Science. 406-415.
23. KRENTEL,M.W. 1988. The complexity of optimization problems. Journal of Computer and System Sciences 36.
24. LAGUNA, M. AND MARTÍ, R. 1999. GRASP and path relinking for 2-layer straight line crossing minimization. INFORMS Journal on Computing 11, 44-52.
25. RESENDE, M. G. C. AND FEO, T. A. 1996. A GRASP for Satisfiability. In Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, D. S. Johnson and M. A. Trick, Eds. Number 26 in DIMACS Series in Discrete Mathematics and Theoretical Computer Science.American Mathematical Society. New Providence, Rhode Island. 499-520..
26. RESENDE, M. G. C. AND PITSOULIS, L. S. 2002. Greedy randomized adaptive search procedures. In Handbook of Applied Optimization, P. M. Pardalos and M. Resende, Eds. Oxford University Press, Oxford. 168-183.
27. RESENDE, M. G. C., PITSOULIS, L. S., AND PARDALOS, P. M. 1997. Approximate solutions of weighted MAX-SAT problems using GRASP. In Satisfiability Problem: Theory and Applications, D.-Z. Du, J. Gu, and P. M. Pardalos, Eds. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society. 393-405.
28. RESENDE, M. G. C., PITSOULIS, L. S., AND PARDALOS, P. M. 2000. Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP. Discrete Applied Mathematics 100, 95-113.
29. RESENDE, M. G. C. AND RIBEIRO, C. C. 2003. A GRASP with path-relinking for private virtual circuit routing. Networks 41, 104-114.
30. RESENDE, M. G. C. AND RIBEIRO, C. C. 2005. GRASP and path-relinking: Recent advances and applications. In Metaheuristics: Progress as Real Problem Solvers, T. Ibaraki, K. Nonobe, and M. Yagiura, Eds. Springer, New York. 29-63.
31. RIBEIRO, C. C., UCHOA, E., AND WERNECK, R. F. 2002. A hybrid GRASP with perturbations for the Steiner problem in graphs. INFORMS Journal on Computing 14, 228-246.
32. th National Conference on Artificial Intelligence. 440-446.
33. SPEARS, W. M. 1996. Simulated annealing for hard satisfiability problems. In Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, D. S. Johnson and M. A. Trick, Eds. Number 26 in DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society. New Providence, Rhode Island. 533-555..
34. TREVISAN, L. 2000. Approximating satisfiable satisfiability problems. Algorithmica 28, 1, 145-172.
35. YANNAKAKIS, M. 1992. On the approximation of maximum Satisfiability. In Proceedings of the Third ACM-SIAM Symposium on Discrete Algorithms. 1-9.