, Volume 8, Issue 1, pp 359-374
Date: 08 Nov 2012

Solving the weighted MAX-SAT problem using the dynamic convexized method

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

Satisfiability (SAT) and maximum satisfiability (MAX-SAT) are difficult combinatorial problems that have many important real-world applications. In this paper we investigate the performance of the dynamic convexized method based heuristics on the weighted MAX-SAT problem. We first present an auxiliary function which is constructed based on a penalty function, and minimize the function by a local search method which can escape successfully from previously converged local minimizers by increasing the value of a parameter. Two algorithms of the approach are implemented and compared with the Greedy Randomized Adaptive Search Procedure (GRASP) and the GRASP with Path Relinking (GRASP + PR). Experimental results illustrate efficient and faster convergence of our two algorithms.

This work was supported in part by the National Science Foundation of China (NSFC) under Grants 61170308 and 10931003, in part by the National Key Basic Research Special Foundation (NKBRSF) of China under Grant 2011CB808000.