GRASP with path-relinking for the weighted maximum satisfiability problem

Lecture Notes in Computer Science

Volumn 3503, Issue , 2005, Pages 367-379

  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

[No Author keywords available]

Indexed keywords

HEURISTIC METHODS; ITERATIVE METHODS; SCHEDULING;

GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE (GRASP); ITERATIONS; METAHEURISTICS; PATH-RELINKING;

PROBLEM SOLVING;

EID: 24944524828     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11427186_32     Document Type: Conference Paper

References (32)

1. R.M. Aiex, S. Binato, and M.G.C. Resende. Parallel GRASP with path-relinking for job shop scheduling. Parallel Computing, 29:393-430, 2003.
2. R.M. Aiex, M.G.C. Resende, P.M. Pardalos, and G. Toraldo. GRASP with path relinking for three-index assignment. INFORMS J. on Computing, 2005. In press.
3. T. Asano. Approximation algorithms for MAX-SAT: Yannakakis vs. Goemans-Williamson. In 5th IEEE Israel Symposium on the Theory of Computing and Systems, pages 24-37, 1997.
4. R. Battiti and M. Protasi. Reactive search, a history-sensitive heuristic for MAX-SAT. ACM Journal of Experimental Algorithms, 2(2), 1997.
5. R. Battiti and M. Protasi. Approximate algorithms and heuristics for the MAX-SAT. In D.Z. Du and P.M. Pardalos, editors, Handbook of Combinatorial Optimization, volume 1, pages 77-148. Kluwer Academic Publishers, 1998.
6. S.A. Canuto, M.G.C. Resende, and C.C. Ribeiro. Local search with perturbations for the prize-collecting Steiner tree problem in graphs. Networks, 38:50-58, 2001.
7. J. Chen, D. Friesen, and H. Zheng. Tight bound on johnson's algorithm for MAX-SAT. In Proceedings of the 12th Annual IEEE Conference on Computational Complexity, pages 274-281, 1997.
8. S.A. Cook. The complexity of theorem-proving procedures. In Proceedings of the Third annual ACM Symposium on Theory of Computing, pages 151-158, 1971.
9. U. Feige and M.X. Goemans. Approximating the value of two proper proof systems, with applications to MAX-2SAT and MAX-DICUT. In Proceeding of the Third Israel Symposium on Theory of Computing and Systems, pages 182-189, 1995.
10. T.A. Feo, M.G.C. Resende, and S.H. Smith. A greedy randomized adaptive search procedure for maximum independent set. Operations Research, 42:860-878, 1994.
11. M.R. Garey and D.S. Johnson. Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman and Company, New York, 1979.
12. I.P. Gent and T. Walsh. Towards an understanding of hill-climbing procedures for SAT. In Proceedings of the 11th National Conference on Artificial Intelligence, pages 28-33, 1993.
13. F. Glover. Tabu search and adaptive memory programming: Advances, applications and challenges. In R.S. Barr, R.V. Helgason, and J.L. Kennington, editors, Interfaces in Computer Science and Operations Research, pages 1-75. Kluwer Academic Publishers, 1996.
14. M.X. Goemans and D.P. Williamson. A new 3/4 approximation algorithm for the maximum satisfiability problem. SIAM Journal on Discrete Mathematics, 7:656-666, 1994.
15. M.X. Goemans and D.P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of Association for Computing Machinery, 42(6):1115-1145, 1995.
16. P. Hansen and B. Jaumard. Algorithms for the maximum satisfiability problem. Computing, 44:279-303, 1990.
17. J. Hastad. Some optimal inapproximability results. Journal of the ACM, 48:798-859, 2001.
18. D.S. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9:256-278, 1974.
19. D.S. Johnson and M.A. Trick, editors. Cliques, coloring, and Satisfiability: Second DIMACS Implementation Challenge. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 1996.
20. H. Karloff and U. Zwick. A 7/8-approximation algorithm for MAX-3SAT. In Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, pages 406-415, 1997.
21. M. Laguna and R. Martí. GRASP and path relinking for 2-layer straight line crossing minimization. INFORMS Journal on Computing, 11:44-52, 1999.
22. M.G.C. Resende and T.A. Feo. A GRASP for Satisfiability. In D.S. Johnson and M. A. Trick, editors, Cliques, coloring, and Satisfiability: Second DIMACS Implementation Challenge, number 26 in DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 499-520. American Mathematical Society, 1996.
23. M.G.C. Resende and L.S. Pitsoulis. Greedy randomized adaptive search procedures. In P.M. Pardalos and M.G.C. Resende, editors, Handbook of Applied Optimization, pages 168-183. Oxford University Press, 2002.
24. M.G.C. Resende, L.S. Pitsoulis, and P.M. Pardalos. Approximate solutions of weighted MAX-SAT problems using GRASP. In D.-Z. Du, J. Gu, and P.M. Pardalos, editors, Satisfiability Problem: Theory and Applications, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 393-405. American Mathematical Society, 1997.
25. M.G.C. Resende, L.S. Pitsoulis, and P.M. Pardalos. Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP. Discrete Applied Mathematics, 100:95-113, 2000.
26. M.G.C. Resende and C.C. Ribeiro. A GRASP with path-relinking for private virtual circuit routing. Networks, 41:104-114, 2003.
27. M.G.C. Resende and C.C. Ribeiro. GRASP and path-relinking: Recent advances and applications. In T. Ibaraki, K. Nonobe, and M. Yagiura, editors, Metaheuristics: Progress as Real Problem Solvers, pages 29-63. Springer, 2005.
28. C.C. Ribeiro, E. Uchoa, and R.F. Werneck. A hybrid GRASP with perturbations for the Steiner problem in graphs. INFORMS Journal on Computing, 14:228-246, 2002.
29. B. Selman, H. Levesque, and D. Mitchell. A new method for solving hard satisfiability instances. In Proceedings of the 10th National Conference on Artificial Intelligence, pages 440-446, 1992.
30. W.M. Spears. Simulated annealing for hard satisfiability problems. In D.S. Johnson and M.A. Trick, editors, Cliques, coloring, and Satisfiability: Second DIMACS Implementation Challenge, number 26 in DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 533-555. American Mathematical Society, 1996.
31. L. Trevisan. Approximating satisfiable satisfiability problems. Algorithmica, 28(1):145-172, 2000.
32. M. Yannakakis. On the approximation of maximum Satisfiability. In Proceedings of the Third ACM-SIAM Symposium on Discrete Algorithms, pages 1-9, 1992.