Solving weighted MAX-SAT via global equilibrium search

Authors:
Oleg V. Shylo;Oleg A. Prokopyev;Vladimir P. Shylo
Affiliations:
Department of ISE, University of Florida, Gainesville, FL 32611, USA;Department of IE, University of Pittsburgh, Pittsburgh, PA 15232, USA;Institute of Cybernetics, NAS of Ukraine, Kiev, Ukraine
Venue:
Operations Research Letters
Year:
2008

Citing 10
Cited 3

Algorithms for the maximum satisfiability problem

Computing
Tabu search

Modern heuristic techniques for combinatorial problems
Reactive search, a history-sensitive heuristic for MAX-SAT

Journal of Experimental Algorithmics (JEA)
Complexity of Partial Satisfaction

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
Guided Local Search for Solving SAT and Weighted MAX-SAT Problems

Journal of Automated Reasoning
Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT: Experimental Evaluation

Journal of Heuristics
Problems of discrete optimization: Challenges and main approaches to solve them

Cybernetics and Systems Analysis
GRASP with path relinking for the weighted MAXSAT problem

Journal of Experimental Algorithmics (JEA)
Global equilibrium search applied to the unconstrained binary quadratic optimization problem

Optimization Methods & Software

Solving the maxcut problem by the global equilibrium search

Cybernetics and Systems Analysis
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
Path Relinking Scheme for the Max-Cut Problem within Global Equilibrium Search

International Journal of Swarm Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this note we investigate the performance of global equilibrium search based heuristics on the weighted MAX-SAT problem. Three variants of the approach are implemented and compared with other existing algorithms on publicly available benchmark instances. The reported computational results indicate high efficiency of the method considered.