Maximum satisfiability problem

Known as: MAXSAT, MAX-SAT, MAX-W-SAT 
In computational complexity theory, the maximum satisfiability problem (MAX-SAT) is the problem of determining the maximum number of clauses, of a… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
The original Extremal Optimization (EO) algorithm and its modified versions have been successfully applied to a variety of NP… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
2011
2011
Based on our recent study on probability distributions for evolution in extremal optimization (EO), we propose a modified… (More)
  • table 1
  • table 2
  • figure 2
  • figure 1
  • figure 3
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Many decision and optimization problems in Electronic Design Automation (EDA) can be solved with Boolean Satisfiability (SAT… (More)
  • figure 2
  • table 1
  • figure 3
Is this relevant?
2006
2006
Stochastic local search algorithms (SLS) have been increasingly applied to approximate solutions of the weighted maximum… (More)
  • table 1
  • table 2
  • figure 1
  • table 3
  • figure 2
Is this relevant?
2005
2005
A GRASP with path-relinking for finding good-quality solutions of the weighted maximum satisfiability problem (MAX-SAT) is… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
1995
Highly Cited
1995
We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2-satisfiability (MAX 2SAT) problems… (More)
  • figure 1
  • figure 2
  • table I
  • table II
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Yannakakis recently presented the first-approximation algorithm for the Maximum Satisfiability Problem (MAX SAT). His algorithm… (More)
Is this relevant?
1993
1993
Given an instance of the maximum satisfiability problem involving n logical variables, truth assignments naturally correspond to… (More)
  • figure 1
  • table 1
  • table 2
Is this relevant?
Highly Cited
1992
Highly Cited
1992
We present a 3/4 polynomial time approximation algorithm for the Maximum Satisfiability problem: Given a set of clauses, find a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Old and new algorithms for the Maximum Satisfiability problem are studied. We first summarize the different heuristics previously… (More)
  • table 6-1
  • table 6.2
  • table 6-3
  • table 6-4
  • table 6-5
Is this relevant?