𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Scatter Search and Genetic Algorithms for MAX-SAT Problems

✍ Scribed by Dalila Boughaci; Belaïd Benhamou; Habiba Drias

Publisher
Springer Netherlands
Year
2008
Tongue
English
Weight
378 KB
Volume
7
Category
Article
ISSN
1570-1166

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation Algorithms for MAX 4-SAT a
Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs
✍ Eran Halperin; Uri Zwick 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 188 KB

Karloff and Zwick obtained recently an optimal 7r8-approximation algorithm for MAX 3-SAT. In an attempt to see whether similar methods can be used to obtain a 7r8-approximation algorithm for MAX SAT, we consider the most natural generalization of MAX 3-SAT, namely MAX 4-SAT. We present a semidefinit

Greedy search and a hybrid local optimiz
Greedy search and a hybrid local optimization/genetic algorithm for tree-based inverse scattering
✍ Raymond A. Wildman; Daniel S. Weile 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 191 KB

## Abstract A genetic programming‐based geometry optimization method for inverse scattering that uses a tree data structure to encode Boolean combinations of convex shapes has recently been shown to outperform other genetic algorithm‐based techniques. Nonetheless, the genetic algorithms are still i