✦ LIBER ✦

A Two-Phase Exact Algorithm for MAX-SAT and Weighted MAX-SAT Problems

✍ Scribed by Brian Borchers; Judith Furman

Book ID: 110279344
Publisher: Springer US
Year: 1998
Tongue: English
Weight: 31 KB
Volume: 2
Category: Article
ISSN: 1382-6905
DOI: 10.1023/a:1009725216438

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Exact Algorithms for MAX-SAT

✍ Hantao Zhang; Haiou Shen; Felip Manyà 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 777 KB

The maximum satisfiability problem (MAX-SAT) is stated as follows: Given a boolean formula in CNF, find a truth assignment that satisfies the maximum possible number of its clauses. MAX-SAT is MAX-SNP-complete and received much attention recently. One of the challenges posed by Alber, Gramm and Nied

Guided Local Search for Solving SAT and

Guided Local Search for Solving SAT and Weighted MAX-SAT Problems

✍ Patrick Mills; Edward Tsang 📂 Article 📅 2000 🏛 Springer Netherlands 🌐 English ⚖ 89 KB

Improving exact algorithms for MAX-2-SAT

✍ Haiou Shen; Hantao Zhang 📂 Article 📅 2005 🏛 Springer Netherlands 🌐 English ⚖ 270 KB

Scatter Search and Genetic Algorithms fo

Scatter Search and Genetic Algorithms for MAX-SAT Problems

✍ Dalila Boughaci; Belaïd Benhamou; Habiba Drias 📂 Article 📅 2008 🏛 Springer Netherlands 🌐 English ⚖ 378 KB

Efficient branch-and-bound algorithms fo

Efficient branch-and-bound algorithms for weighted MAX-2-SAT

✍ Toshihide Ibaraki; Takashi Imamichi; Yuichi Koga; Hiroshi Nagamochi; Koji Nonobe 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 509 KB

A polynomial-time algorithm for reducing

A polynomial-time algorithm for reducing the number of variables in MAX SAT problem

✍ Shaohan Ma; Dongmin Liang 📂 Article 📅 1997 🏛 SP Science China Press 🌐 English ⚖ 570 KB