Get started
Keyword

MaxSAT

Description: MaxSAT is a computational optimization problem that seeks an assignment satisfying the greatest possible number of clauses in a Boolean formula.
Wikidata ID: wiki/Q17080584
OpenAlex ID: keywords/maxsat
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
1995 · Michel X. Goemans, David P. Williamson · Journal of the ACM · 3,583
PDF
Proof verification and the hardness of approximation problems
1998 · Sanjeev Arora, Carsten Lund, et al. · Journal of the ACM · 1,414
PDF
Stochastic Local Search: Foundations & Applications
2004 · Holger H. Hoos, Thomas St�tzle · Medical Entomology and Zoology · 1,220
Noise strategies for improving local search
1994 · Bart Selman, Henry Kautz, et al. · 750
Proof verification and hardness of approximation problems
1992 · S. Arora, C. Lund, et al. · Annual Symposium on Foundations of Computer Science · 741
The Sat4j library, release 2.2
2010 · Daniel Le Berre, Anne Parrain · Journal on Satisfiability Boolean Modeling and Computation · 455
PDF
Parameterizing above Guaranteed Values: MaxSat and MaxCut
1999 · Meena Mahajan, Venkatesh Raman · Journal of Algorithms · 303
Local Search Strategies for Satisfiability Testing
1995 · Bart Selman, Henry Kautz, et al. · 234
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization
2015 · Niv Buchbinder, Moran Feldman, et al. · SIAM Journal on Computing · 218
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization
2012 · Niv Buchbinder, Moran Feldman, et al. · Annual Symposium on Foundations of Computer Science · 216
On the Approximation of Maximum Satisfiability
1994 · M. Yannakakis · Journal of Algorithms · 200
Scalable knowledge harvesting with high precision and high recall
2011 · Ndapandula Nakashole, Martin Theobald, et al. · ACM International Conference on Web Search and Data Mining (WSDM) · 193
HyFlex: A Benchmark Framework for Cross-Domain Heuristic Search
2012 · Gabriela Ochoa, Matthew Hyde, et al. · Lecture notes in computer science · 187
Cause clue clauses
2011 · Manu Jose, Rupak Majumdar · ACM SIGPLAN Notices · 185
MaxSAT, Hard and Soft Constraints
2009 · Li Chu Min, Manyà Felip · Frontiers in artificial intelligence and applications · 181
Solving weighted CSP by maintaining arc consistency
2004 · Javier Larrosa, Thomas Schiex · Artificial Intelligence · 172
PDF
On the satisfiability and maximum satisfiability of random 3-CNF formulas
1993 · Andrei Broder, Alan Frieze, et al. · Symposium on Discrete Algorithms · 171
Open-WBO: A Modular MaxSAT Solver,
2014 · Ruben Martins, Vasco Manquinho, et al. · Lecture notes in computer science · 167
Iterative and core-guided MaxSAT solving: A survey and assessment
2013 · Antonio Morgado, Federico Heras, et al. · Constraints · 165
UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT and MAX-SAT
2005 · Dave A. D. Tompkins, Holger H. Hoos · Lecture notes in computer science · 160
Exploiting Configurations of MaxSAT Solvers
2022 · Alòs, Josep, Ansótegui, Carlos, et al. · Repositori ObertUDL (University of Lleida) · 158
New Inference Rules for Max-SAT
2007 · C. M. Li, F. Manya, et al. · Journal of Artificial Intelligence Research · 157
PDF
Generic ILP versus specialized 0-1 ILP
2002 · Fadi A. Aloul, Arathi Ramani, et al. · Digest of technical papers/Digest of technical papers - IEEE/ACM International Conference on Computer-Aided Design · 157
On SAT Modulo Theories and Optimization Problems
2006 · Robert Nieuwenhuis, Albert Oliveras · Lecture notes in computer science · 156
Modeling the problem of locating collection areas for urban waste management. An application to the metropolitan area of Barcelona
2005 · Joaquín Bautista, Jordi Pereira · Omega · 154
Works count: 1,755
Citation count: 27,870
Year
Topic
Type