Author:
Layeb Abdesslem,Saidouni Djamel-Eddine
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Cook, S.A.: The Complexity of Theorem Proving Procedures. In: Proc. 3rd Ann. ACM Symp. On Theory of Computing, Association for Computing Machinery, pp. 151–158 (1971)
2. Alsinet, T., Manya, F., Planes, J.: Improved Branch and Bound Algorithms for Max-2-SAT and Weighted Max-2-SAT. In: Proceedings of Sixth Catalan Conference on Artificial Intelligence (CCIA 2003) (October 2003)
3. Marchiori, E., Rossi, C.: A Flipping Genetic Algorithm for Hard 3-SAT Problems. In: Proc. of the Genetic and Evolutionary Computation Conference, vol. 1, pp. 393–400 (1999)
4. Marques-Silva, J.P., Sakallah, K.A.: GRASP: A Search Algorithm for Propositional Satisfiability. IEEE Transactions on Computers 48(5), 506–521 (1999)
5. Holger, H., Stützle, T.: Local search algorithms for SAT: An empirical evaluation. Journal of Automated Reasoning 24(4), 421–481 (2000)
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献