Results 1  10
of
928,031
Exact Algorithms for MAXSAT
 In 4th Int. Workshop on First order Theorem Proving
, 2003
"... The maximum satisfiability problem (MAXSAT) is stated as follows: Given Boolean formula in CNF, find a truth assignment that satisfies the maximum possible number of its clauses. MAXSAT is MAXSNPcomplete and received much attention recently. One of the challenges posed by Alber, Gramm and Nieder ..."
Abstract

Cited by 20 (7 self)
 Add to MetaCart
The maximum satisfiability problem (MAXSAT) is stated as follows: Given Boolean formula in CNF, find a truth assignment that satisfies the maximum possible number of its clauses. MAXSAT is MAXSNPcomplete and received much attention recently. One of the challenges posed by Alber, Gramm
Improved Exact Solver for the Weighted MaxSAT Problem
"... Many exact MaxSAT solvers use a branch and bound algorithm, where the lower bound is calculated with a combination of MaxSAT resolution and detection of disjoint inconsistent subformulas. We propose a propagation algorithm which improves the detection of disjoint inconsistent subformulas compared ..."
Abstract
 Add to MetaCart
Many exact MaxSAT solvers use a branch and bound algorithm, where the lower bound is calculated with a combination of MaxSAT resolution and detection of disjoint inconsistent subformulas. We propose a propagation algorithm which improves the detection of disjoint inconsistent subformulas
Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming
 Journal of the ACM
, 1995
"... We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds the solution ..."
Abstract

Cited by 1231 (13 self)
 Add to MetaCart
We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds
A twophase exact algorithm for MAXSAT and weighted MAXSAT problems
 Journal of Combinatorial Optimization
, 1997
"... We describe a two phase algorithm for MAXSAT and weighted MAX SAT problems. In the first phase, we use the GSAT heuristic to find a good solution to the problem. In the second phase, we use an enumeration procedure based on the DavisPutnamLoveland algorithm, to find a provably optimal soluti ..."
Abstract

Cited by 82 (4 self)
 Add to MetaCart
We describe a two phase algorithm for MAXSAT and weighted MAX SAT problems. In the first phase, we use the GSAT heuristic to find a good solution to the problem. In the second phase, we use an enumeration procedure based on the DavisPutnamLoveland algorithm, to find a provably optimal
Approximation algorithms for MaxSAT
"... The main aim of NPcompleteness theory is the analysis of intractability. Many optimization problems were first proved to be NPhard. Since the complete solution of these problems requires exponential time, polynomial time algorithms to find "nearoptimal" solutions, i.e., approximation al ..."
Abstract
 Add to MetaCart
The main aim of NPcompleteness theory is the analysis of intractability. Many optimization problems were first proved to be NPhard. Since the complete solution of these problems requires exponential time, polynomial time algorithms to find "nearoptimal" solutions, i.e., approximation
New inference rules for MaxSAT
 JAIR
, 2007
"... Abstract. Exact MaxSAT solvers, compared with SAT solvers, apply little inference at each node of the proof tree. Commonly used SAT inference rules like unit propagation produce a simplified formula that preserves satisfiability but, unfortunately, solving the MaxSAT problem for the simplified for ..."
Abstract

Cited by 42 (9 self)
 Add to MetaCart
Abstract. Exact MaxSAT solvers, compared with SAT solvers, apply little inference at each node of the proof tree. Commonly used SAT inference rules like unit propagation produce a simplified formula that preserves satisfiability but, unfortunately, solving the MaxSAT problem for the simplified
The Maximum Clique Problem
, 1999
"... Contents 1 Introduction 2 1.1 Notations and Definitions . . . . . . . . . . . . . . . . . . . . . . . . 3 2 Problem Formulations 4 2.1 Integer Programming Formulations . . . . . . . . . . . . . . . . . . . 5 2.2 Continuous Formulations . . . . . . . . . . . . . . . . . . . . . . . . 8 3 Computation ..."
Abstract

Cited by 195 (21 self)
 Add to MetaCart
Computational Complexity 12 4 Bounds and Estimates 15 5 Exact Algorithms 19 5.1 Enumerative Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . 19 5.2 Exact Algorithms for the Unweighted Case . . . . . . . . . . . . . . 21 5.3 Exact Algorithms for the Weighted Case . . . . . . . . . . . . . . . . 25 6
Improved exact algorithms for MAXSAT
 Discrete Applied Mathematics
, 2002
"... In this paper we present improved exact and parameterized algorithms for the maximum satisfiability problem. In particular, we give an algorithm that computes a truth assignment for a boolean formula F satisfying the maximum number of clauses in time O(1.3247 m F ), where m is the number of clause ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
In this paper we present improved exact and parameterized algorithms for the maximum satisfiability problem. In particular, we give an algorithm that computes a truth assignment for a boolean formula F satisfying the maximum number of clauses in time O(1.3247 m F ), where m is the number
MINIMAXSAT: An Efficient Weighted MaxSAT Solver
"... In this paper we introduce MINIMAXSAT, a new MaxSAT solver that is built on top of MINISAT+. It incorporates the best current SAT and MaxSAT techniques. It can handle hard clauses (clauses of mandatory satisfaction as in SAT), soft clauses (clauses whose falsification is penalized by a cost as in ..."
Abstract

Cited by 39 (1 self)
 Add to MetaCart
as in MaxSAT) as well as pseudoboolean objective functions and constraints. Its main features are: learning and backjumping on hard clauses; resolutionbased and substractionbased lower bounding; and lazy propagation with the twowatched literal scheme. Our empirical evaluation comparing a wide set
Results 1  10
of
928,031