Efficient 2 and 3-flip neighborhood search algorithms for the MAX SAT: Experimental evaluation

Journal of Heuristics

Volumn 7, Issue 5, 2001, Pages 423-442

  Yagiura, M ^a   Ibaraki, T ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

Local search; Metaheuristics; Neighborhood; SAT; Weighted MAX SAT

Indexed keywords

FUNCTIONS; HEURISTIC METHODS; ONLINE SEARCHING; PROBLEM SOLVING; SET THEORY;

LOCAL SEARCH; NEIGHBORHOOD;

ALGORITHMS;

EID: 0035447517     PISSN: 13811231     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1011306011437     Document Type: Article

References (22)

1. Local search algorithms for partial MAXSAT
2. Improvements to propositional satisfiability search algorithms
3. Variable-selection heuristics in local search for SAT
4. Efficient local search for very large-scale satisfiability problems
5. Algorithms for the maximum satisfiability problem
6. Branch-and-cut solution of inference problems in propositional logic
7. An interior point algorithm to solve computationally difficult set covering problems
8. Solving hard set covering problems
9. Tabu search for SAT
10. A tabu search approach to the CSP (constraint satisfaction problem) as a general problem solver
11. Improved solutions to the steiner triple covering problem
12. A parallel GRASP for MAX-SAT problems
13. A GRASP for satisfiability
14. Approximate solution of weighted MAX-SAT problems using GRASP
15. FORTRAN subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP
16. A new method for solving hard satisfiability problems
17. An empirical study of greedy local search for satisfiability testing
18. Domain-independent extensions to GSAT: Solving large structured satisfiability problems
19. Noise strategies for improving local search
20. Local search strategies for satisfiability testing
21. Analyses on the 2 and 3-flip neighborhoods for the MAX SAT