Author:
Boughaci Dalila,Benhamou Belaïd,Drias Habiba
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Modelling and Simulation
Reference36 articles.
1. Alsinet, T., Manya, F., Planes, J.: Improved branch and bound algorithms for MAX-SAT. In: Proceedings of the 6th International Conference on the Theory and Applications of Satisfiability Testing. SAT2003, pp. 408–415 (2003)
2. Boughaci, D., Drias, H.: Efficient and experimental meta-heuristics for MAX-SAT problems. In: Lecture Notes in Computer Sciences, WEA 2005, vol. 3503/2005, pp. 501–512 (2005)
3. Boughaci, D., Drias, H., Benhamou, B.: Solving Max-SAT problems using a mimetic evolutionary meta-heuristic. In: Proceedings of 2004 IEEE CIS 2004, pp. 480–484 (2004)
4. Borchers, B., Furman, J.: A two-phase exact algorithm for Max-SAT and weighted Max-SAT problems. J. Comb. Optim. 2(4), 299–306 (1999)
5. Cook, S.A.: The complexity of theorem proving procedures. In: Proceedings of the 3rd ACM Symposium on Theory of Computing, pp. 151–158. Ohio (1971)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献