C. Ansótegui, M. L. Bonet, and J. Levy, Solving (Weighted) Partial MaxSAT through Satisfiability Testing, Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing, pp.2009-427
DOI : 10.1007/11564751_73

A. Avidor and U. Zwick, Approximating MIN 2-SAT and MIN 3-SAT, Theory of Computing Systems, pp.329-345, 2005.
DOI : 10.1007/s00224-005-1140-7

T. Fahle, Simple and fast : Improving a branch-andbound algorithm for maximum clique, Proceedings of ESA-2002, pp.485-498, 2002.

G. Felici and K. Truemper, A MINSAT Approach for Learning in Logic Domains, INFORMS Journal on Computing, vol.14, issue.1, pp.20-36, 2002.
DOI : 10.1287/ijoc.14.1.20.7709

A. Goldstein, P. Kolman, and J. Zheng, Minimum Common String Partition Problem: Hardness and Approximations, Electr. J. Comb, vol.12, 2005.
DOI : 10.1007/978-3-540-30551-4_43
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.296.1220

R. Kohli, R. Krishnamurti, and P. Mirchandani, The Minimum Satisfiability Problem, SIAM Journal on Discrete Mathematics, vol.7, issue.2
DOI : 10.1137/S0895480191220836

J. Konc and D. Janezic, An improved branch and bound algorithm for the maximum clique problem, Communications in Mathematical and in Computer Chemistry, vol.58, pp.569-590, 2007.

C. M. , L. , and F. Manyà, Max-SAT, hard and soft constraints, Handbook of Satisfiability, pp.613-631, 2009.

C. Li, F. Manyà, and J. Planes, New inference rules for Max-SAT, Journal of Artificial Intelligence Research, vol.30, pp.321-359, 2007.

M. Vasco, . Manquinho, P. M. João, J. Silva, and . Planes, Algorithms for weighted boolean optimization, Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing, pp.2009-495

M. V. Marathe and S. S. Ravi, On approximation algorithms for the minimum satisfiability problem, Information Processing Letters, vol.58, issue.1, pp.23-29, 1996.
DOI : 10.1016/0020-0190(96)00031-2

P. R. Ostergard, A fast algorithm for the maximum clique problem, Discrete Applied Mathematics, vol.120, issue.1-3, pp.197-207, 2002.
DOI : 10.1016/S0166-218X(01)00290-6

E. Tomita and T. Seki, An efficient branch-andbound algorithm for finding a maximum clique, Proc. Discrete Mathematics and Theoretical Computer Science, pp.278-289, 2003.