Skip to main content
Book Chapter

Approximate Algorithms and Heuristics for MAX-SAT

  • Battiti R
  • Protasi M
Springer US, (1998), 77-148
DOI: 10.1007/978-1-4613-0303-9_2
N/ACitations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In the Maximum Satisfiability (MAX-SAT) problem one is given a Boolean formula in conjunctive normal form, i.e., as a conjunction of clauses, each clause being a disjunction. The task is to find an assignment of truth values to the variables that satisfies the maximum number of clauses.

Cite

CITATION STYLE

APA

Battiti, R., & Protasi, M. (1998). Approximate Algorithms and Heuristics for MAX-SAT. In Handbook of Combinatorial Optimization (pp. 77–148). Springer US. https://doi.org/10.1007/978-1-4613-0303-9_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free