GRASP with path relinking for the weighted MAXSAT problem

Authors:
Paola Festa;Panos M. Pardalos;Leonidas S. Pitsoulis;Mauricio G. C. Resende
Affiliations:
University of Napoli Federico II, Napoli, Italy;University of Florida, Gainesville, FL;Aristotle University of Thessaloniki, Thessaloniki, Greece;AT&T Labs Research, Florham Park, NJ
Venue:
Journal of Experimental Algorithmics (JEA)
Year:
2007

Citing 19
Cited 6

The complexity of optimization problems

Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
How easy is local search?

Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
Algorithms for the maximum satisfiability problem

Computing
On the approximation of maximum satisfiability

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
New ${\bf \frac{3}{4}}$-Approximation Algorithms for the Maximum Satisfiability Problem

SIAM Journal on Discrete Mathematics
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
Reactive search, a history-sensitive heuristic for MAX-SAT

Journal of Experimental Algorithmics (JEA)
Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP

Discrete Applied Mathematics
Some optimal inapproximability results

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Grasp and Path Relinking for 2-Layer Straight Line Crossing Minimization

INFORMS Journal on Computing
A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs

INFORMS Journal on Computing
Parallel GRASP with path-relinking for job shop scheduling

Parallel Computing - Special issue: Parallel computing in numerical optimization
Tight Bound on Johnson's Algoritihm for Max-SAT

CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
A 7/8-Approximation Algorithm for MAX 3SAT?

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Approximation Algorithms for MAX SAT: Yannakakis vs. Goemans-Williamson

ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT

ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
GRASP with Path Relinking for Three-Index Assignment

INFORMS Journal on Computing

Portfolios in Stochastic Local Search: Efficiently Computing Most Probable Explanations in Bayesian Networks

Journal of Automated Reasoning
Path-relinking intensification methods for stochastic local search algorithms

Journal of Heuristics
Solving weighted MAX-SAT via global equilibrium search

Operations Research Letters
Global equilibrium search algorithms for combinatorial optimization problems

PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part II
A Hyper-Heuristic Using GRASP with Path-Relinking: A Case Study of the Nurse Rostering Problem

Journal of Information Technology Research
Community detection by modularity maximization using GRASP with path relinking

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

A GRASP with path relinking for finding good-quality solutions of the weighted maximum satisfiability problem (MAX-SAT) is described in this paper. GRASP, or Greedy Randomized Adaptive Search Procedure, is a randomized multistart metaheuristic, where, at each iteration, locally optimal solutions are constructed, each independent of the others. Previous experimental results indicate its effectiveness for solving weighted MAX-SAT instances. Path relinking is a procedure used to intensify the search around good-quality isolated solutions that have been produced by the GRASP heuristic. Experimental comparison of the pure GRASP (without path relinking) and the GRASP with path relinking illustrates the effectiveness of path relinking in decreasing the average time needed to find a good-quality solution for the weighted maximum satisfiability problem.