Article ID: | iaor19952199 |
Country: | Switzerland |
Volume: | 55 |
Issue: | 1 |
Start Page Number: | 139 |
End Page Number: | 178 |
Publication Date: | May 1995 |
Journal: | Annals of Operations Research |
Authors: | Radermacher Franz Josef, Mayer Joachim, Mitterreiter Ilse |
Satisfiability problems are of importance for many practical problems. They are NP-complete problems. However, some instances of the SAT problem can be solved efficiently. This paper reports on a study concerning the behaviour of a variety of algorithmic approaches to this problem tested on a set of problems collected at FAW. The results obtained give a lot of insight into the algorithms and problems, yet also show some general technical and methodological problems associated with such comparisons.