A parallel GRASP for MAX-SAT problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1184, Issue , 1996, Pages 575-585

  Pardalos, P M ^a   Pitsoulis, L ^a   Resende, M G C ^b  

^a University of Florida   (United States)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

GRASP; Heuristics; Maximum satisfiability; Parallel computing; Parallel search

Indexed keywords

FORMAL LOGIC; HEURISTIC ALGORITHMS; PARALLEL PROCESSING SYSTEMS;

COMPUTING THEORY; GRASP; GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE; HEURISTICS; MAX-SAT PROBLEMS; MAXIMUM SATISFIABILITY; PARALLEL SEARCH; WEIGHTED MAXIMUM SATISFIABILITY;

OPTIMIZATION;

EID: 84947923580     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62095-8_62     Document Type: Conference Paper

References (13)

1. G.Y. Ananth, V. Kumar, and P.M. Pardalos. Parallel processing of discrete optimization problems. In Encyclopedia o] Microcomputers, volume 13, pages 129-147. Marcel Dekker Inc., New York, 1993.
2. 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.
3. T.A. Feo and M.G.C. Resende. Greedy randomized adaptive search procedures. Journal of Global Optimization, 6:109-133, 1995.
4. A. Ferreira and P.M. Pardalos, editors. Solving Combinatorial Optimization Problems in Parallel: Methods and Techniques, volume 1054 of Lecture Notes in Computer Science. Springer-Verlag, 1996.
5. 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.
6. A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Mancheck, and V. Sunderam. PVM: Parallel Virtual Machine A Users Guide and Tutorial for Networked Parallel Computing. Scientific and Engineering Computation. MIT Press, Massachusetts Institute of Technology, 1994.
7. J. Gu. Parallel algorithms for satisfiability (SAT) problems. In P.M. Pardalos, M.G.C. Resende, and K.G. Ramakrishnan, editors, Parallel Processing of Discrete Optimization Problems, volume 22 of DIMA CS Series in Discrete Mathematics and Theoretical Computer Science, pages 105-161. American Mathematical Society, 1995.
8. 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.
9. P.M. Pardalos, L. Pitsoulis, T. Mavridou, and M.G.C. Resende. Parallel search for combinatorial optimization: Genetic algorithms, simulated annealing and GRASP. Lecture Notes in Computer Science, 980:317-331, 1995.
10. P.M. Pardalos, L.S. Pitsoulis, and M.G.C. Resende. A parallel GRASP implementation for the quadratic assignment problem. In A. Ferreira and J. Rolim, editors, Parallel Algorithms for Irregularly Structured Problems - Irregular'94, pages 111-130. Kluwer Academic Publishers, 1995.
11. P.M. Pardalos, M.G.C. Resende, and K.G. Ramakrishnan, editors. Parallel Processing of Discrete Optimization Problems, volume 22 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 1995.
12. 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, DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 1996.
13. M.G.C. Resende, L. Pitsoulis, and P.M. Pardalos. Approximate solution of weighted max-sat problems using grasp. In DingZu Du, Jun Gu, and Panos M. Pardalos, editors, Satisfiability Problem: Theory and Applications, DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 1996.