Everything about Maximum satisfiability problem

🧭 Start here: a 6-step reading path

1. Read the overview: Maximum satisfiability problemA 5-minute orientation
2. Skim a recent paper: Spintronics-compatible Approach to Solving Maximum-Satisfiability Problems with Probabilistic Computing, Invertible Logic, and Parallel TemperingInfluential work since 2022
3. Pick up a classic book: The Conspirators HierarchyThe most-reprinted book on the subject
4. Read the landmark paper: Algorithms for the maximum satisfiability problemCited 245 times
5. Go sideways: MAXEkSATA closely related topic
6. Go sideways: 2-satisfiabilityA closely related topic

🏆 Landmark papers (most cited)

• Algorithms for the maximum satisfiability problem

  Pierre Hansen, Brigitte Jaumard · 1990 · Computing · 245 citations

• New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem

  Michel X. Goemans, David P. Williamson · 1994 · SIAM Journal on Discrete Mathematics · 177 citations

• A Dichotomy Theorem for Maximum Generalized Satisfiability Problems

  N. Creignou · 1995 · Journal of Computer and System Sciences · 87 citations

• Maximum Satisfiability: Anatomy of the Fitness Landscape for a Hard Combinatorial Optimization Problem

  Adam Prugel-Bennett, Mohammad-Hassan Tayarani-Najaran · 2012 · IEEE Transactions on Evolutionary Computation · 48 citations

• Modified extremal optimization for the hard maximum satisfiability problem

  Guo-qiang Zeng, Yong-zai Lu, Wei-Jie Mao · 2011 · Journal of Zhejiang University SCIENCE C · 42 citations

• On the complexity of the maximum satisfiability problem for horn formulas

  Brigitte Jaumard, Bruno Simeone · 1987 · Information Processing Letters · 36 citations

• Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds

  Matthias Poloczek, Georg Schnitger, David P. Williamson · 2017 · SIAM Journal on Computing · 27 citations

• An effective heuristic algorithm for the maximum satisfiability problem

  Mohamed El Bachir Menaï, Mohamed Batouche · 2006 · Applied Intelligence · 19 citations

🆕 Influential since 2022

• Spintronics-compatible Approach to Solving Maximum-Satisfiability Problems with Probabilistic Computing, Invertible Logic, and Parallel Tempering

  Andrea Grimaldi, Luis Sánchez-Tejerina, Navid Anjum Aadit · 2022 · Physical Review Applied · 42 citations

• A Refined Branching Algorithm for the Maximum Satisfiability Problem

  Wenjun Li, Chao Xu, Yongjie Yang · 2022 · Algorithmica · 4 citations

• Proof Complexity for the Maximum Satisfiability Problem and its Use in SAT Refutations

  Emma Rollon, Javier Larrosa · 2022 · Journal of Logic and Computation · 1 citations

• Revisiting maximum satisfiability and related problems in data streams

  Hoa T. Vu · 2024 · Theoretical Computer Science · 1 citations

• On the Counting Version of the Maximum 2-Satisfiability Problem

  V. Yu. Popov · 2025 · Mathematical Notes · 0 citations

📚 Books worth reading

• The Conspirators HierarchyJohn Coleman · 1992
• Parallel Programming in C with MPI and OpenMPMichael J. Quinn · 2003
• Recent Trends in Applied Artificial IntelligenceMoonis Ali · 2013
• প্রোগ্রামিং কনটেস্টমোঃ মাহবুবুল হাসান · 2016
• Aspects of semidefinite programmingEtienne de Klerk · 2002
• Discrete MathmaticsR. K. Bisht, H. S. Dhami · 2015
• The Human Planet · 2009
• survival companion for medical students, graduates and interns · 2014

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics

• MAXEkSAT MAXEkSAT is a problem in computational complexity theory that is a maximization version of the Boolean satisfiability problem 3SAT. In MAXEkSAT, each clause…
• 2-satisfiability In computer science, 2-satisfiability, 2-SAT or just 2SAT is a computational problem of assigning values to variables, each of which has two possible values…
• Boolean satisfiability algorithm heuristics In computer science, there are certain classes of algorithms (heuristics) that solves types of the Boolean satisfiability problem despite there being no…
• Boolean satisfiability problem In logic and computer science, the Boolean satisfiability problem (sometimes called propositional satisfiability problem and abbreviated SATISFIABILITY…
• MAX-3SAT MAX-3SAT is a problem in the computational complexity subfield of computer science. It generalises the Boolean satisfiability problem (SAT) which is a…
• WalkSAT In computer science, GSAT and WalkSAT are local search algorithms to solve Boolean satisfiability problems. Both algorithms work on formulae in Boolean…
• ♯SAT In computer science, the Sharp Satisfiability Problem (sometimes called Sharp-SAT, #SAT or model counting) is the problem of counting the number of interpretati…
• Karloff–Zwick algorithm The Karloff–Zwick algorithm, in computational complexity theory, is a randomised approximation algorithm taking an instance of MAX-3SAT Boolean satisfiability…