𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Probabilistic bounds and algorithms for the maximum satisfiability problem

✍ Scribed by Endre Boros; András Prékopa

Book ID
112669111
Publisher
Springer US
Year
1989
Tongue
English
Weight
879 KB
Volume
21
Category
Article
ISSN
0254-5330

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Mixed-integer column generation algorith
Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem
✍ Pierre Hansen; Brigitte Jaumard; Marcus Poggi de Araga˜o 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 950 KB

The column generation approach to large-scale linear programming is extended to the mixed-integer case. Two general algorithms, a dual and a primal one, are presented. Both involve finding k-best solutions to combinatorial optimization subproblems. Algorithms for these subproblems must be tailored t

Tight Bound on Johnson's Algorithm for M
Tight Bound on Johnson's Algorithm for Maximum Satisfiability
✍ Jianer Chen; Donald K. Friesen; Hao Zheng 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 223 KB

We present new techniques that give a more thorough analysis on Johnson's classical algorithm for the Maximum Satisfiability problem. In contrast to the common belief for two decades that Johnson's Algorithm has performance ratio 1Â2, we show that the performance ratio is 2Â3 and that this bound is