Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,320 papers from all fields of science
Search
Sign In
Create Free Account
Maximum satisfiability problem
Known as:
MAXSAT
, MAX-SAT
, MAX-W-SAT
Expand
In computational complexity theory, the maximum satisfiability problem (MAX-SAT) is the problem of determining the maximum number of clauses, of a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
19 relations
2-satisfiability
APX
Approximation algorithm
Boolean satisfiability problem
Expand
Broader (2)
Combinatorial optimization
Logic in computer science
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Volt: A Lazy Grounding Framework for Solving Very Large MaxSAT Instances
Ravi Mangal
,
Xin Zhang
,
A. Nori
,
M. Naik
International Conference on Theory and…
2015
Corpus ID: 15189953
Very large MaxSAT instances, comprising \(10^{20}\) clauses and beyond, commonly arise in a variety of domains. We present VOLT…
Expand
2012
2012
BACKBONE GUIDED EXTREMAL OPTIMIZATION FOR THE HARD MAXIMUM SATISFIABILITY PROBLEM
Guo-qiang Zeng
,
Yongzai Lu
,
+4 authors
Chong-Wei Zheng
2012
Corpus ID: 17221794
The original Extremal Optimization (EO) algorithm and its modified versions have been successfully applied to a variety of NP…
Expand
2011
2011
Modified extremal optimization for the hard maximum satisfiability problem
Guo-qiang Zeng
,
Yongzai Lu
,
W. Mao
Journal of Zhejiang University SCIENCE C
2011
Corpus ID: 22438266
Based on our recent study on probability distributions for evolution in extremal optimization (EO), we propose a modified…
Expand
2011
2011
Simpler 3/4-Approximation Algorithms for MAX SAT
A. V. Zuylen
Workshop on Approximation and Online Algorithms
2011
Corpus ID: 2791065
We consider the recent randomized 3/4-algorithm for MAX SAT of Poloczek and Schnitger. We give a much simpler set of…
Expand
2005
2005
GRASP with Path-Relinking for the Weighted Maximum Satisfiability Problem
P. Festa
,
P. Pardalos
,
L. Pitsoulis
,
M. G. Resende
Workshop on Engineering Applications
2005
Corpus ID: 2672531
A GRASP with path-relinking for finding good-quality solutions of the weighted maximum satisfiability problem (MAX-SAT) is…
Expand
1999
1999
Tight Bound on Johnson's Algorithm for Maximum Satisfiability
Jianer Chen
,
D. Friesen
,
Hao Zheng
Journal of computer and system sciences (Print)
1999
Corpus ID: 18675643
We present new techniques that give a more thorough analysis on Johnson's classical algorithm for the Maximum Satisfiability…
Expand
1998
1998
K-sat on groups and undecidability
M. Freedman
Symposium on the Theory of Computing
1998
Corpus ID: 15292855
The general Boolean formula can be quickly converted into a normal form, A$, the conjunction of triple disjunctions of literals…
Expand
Review
1996
Review
1996
A branch and cut algorithm for MAX-SAT and weighted MAX-SAT
S. Joy
,
J. Mitchell
,
B. Borchers
Satisfiability Problem: Theory and Applications
1996
Corpus ID: 7535998
DIMACS Series in Discrete Mathematicsand Theoretical Computer ScienceVolume00, 19xxA Branch and Cut Algorithm for MAX-SAT and…
Expand
1982
1982
Algorithmic Extremal Problems in Combinatorial Optimization
K. Lieberherr
J. Algorithms
1982
Corpus ID: 6187662
1981
1981
1231 CORRELATES OF TIME OF UTILIZATION OF NEONATAL TRANSPORT & MORBIDITY OUTCOME
S. Ahn
,
A. Ferrara
Pediatric Research
1981
Corpus ID: 34460670
The hypothesis that in time of scarce resources (weekend, after midnight, etc.) ↑ utilization of the service would occur…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE