A. M. , T. Achterberg, and T. Koch, Miplib -mixed integer problem library, 2005.

A. Fadi, A. Aloul, I. L. Ramani, K. A. Markov, and . Sakallah, Generic ilp versus specialized 0-1 ilp: an update, ICCAD, pp.450-457, 2002.

J. Argelich, Random partial max-sat generator

J. Argelich, C. M. Li, F. Manyá, and J. Planes, The first and second max-sat evaluations, Journal on Satisfiability, Boolean Modeling and Computation

E. Bensana, M. Lemaitre, and G. Verfaillie, Earth observation satellite management, Constraints, vol.4, issue.3, pp.293-299, 1999.

B. Cha, K. Iwama, Y. Kambayashi, and S. Miyazaki, Local search algorithms for partial MAXSAT, Proceedings of the National Conference on Artificial Intelligence, AAAI-97, pp.263-268, 1997.

M. Cooper, High-order consistency in valued constraint satisfaction, Constraints, vol.10, pp.283-305, 2005.

M. Cooper, S. Cussat-blanc, M. De-roquemaurel, and P. Régnier, Soft arc consistency applied to optimal planning, Proceedings of the International Conference on Principles and Practice of Constraint Programming, pp.680-684, 2006.

S. De-givry, F. Heras, J. Larrosa, E. Rollon, M. Sanchez et al., The wcsp repository, 2003.

G. Simon-de, Random binary max-csp generator, file random vcsp, 1995.

N. Eén and N. Sörensson, Translating pseudo-Boolean constraints into SAT, Boolean Modeling and Computation, vol.2, pp.1-26, 2006.

M. Elf, C. Gutwenger, M. Jünger, and G. Rinaldi, Branch-andcut algorithms for combinatorial optimization and their implementation in abacus, Computational Combinatorial Optimization, pp.157-222, 2001.

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

C. Gomes, lsencode: A generator of quasigroup completion problem and related problems

F. Heras and J. Planes, Random graph generator, file random graph, 2005.

D. S. Johnson and M. A. Trick, Second dimacs implementation challenge: Finding cliques in graphs, coloring graphs, and solving satisfiability problems, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 1994.

M. Jünger and F. Liers, Spin glass server

M. Pearson, K. Leyton-brown, and Y. Shoham, Towards a universal test suite for combinatorial auction algorithms, ACM Conference on Electronic Commerce, pp.66-76, 2000.

J. Larrosa and T. Schiex, In the quest of the best form of local consistency for weighted CSP, Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI-03, 2003.

J. Larrosa, Node and arc consistency in weighted CSP, Proceedings of the National Conference on Artificial Intelligence, AAAI-02, pp.48-53, 2002.

J. Larrosa, Weighted queens generator, file wqueens, 2004.

V. Manquinho and O. Roussel, , 2006.

V. Manquinho and O. Roussel, The first evaluation of pseudo-Boolean solvers (pb'05), Journal on Satisfiability, Boolean Modeling and Computation, vol.2, pp.103-143, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00110082

C. Pizzuti, Computing prime implicants by integer programming, ICTAI, pp.332-336, 1996.

T. Sandholm, An algorithm for optimal winner determination in combinatorial auctions, Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI-99, pp.542-547, 1999.

B. Selman, Program for generating random instances of sat problems, 1992.

H. M. Sheini and K. A. Sakallah, Pueblo: A hybrid pseudo-Boolean SAT solver, Journal on Satisfiability, Boolean Modeling and Computation, vol.2, pp.165-189, 2006.

H. Shen and H. Zhang, Study of lower bounds for Max-2-SAT, Proceedings of the National Conference on Artificial Intelligence, AAAI-04, 2004.

L. Simon, D. L. Berre, and E. A. Hirsch, , 2002.

C. Simone, M. Diehl, M. Jünger, P. Mutzel, G. Reinelt et al., Exact ground states in spin glasses: New experimental results with a branch-and-cut algorithm, Journal of Statistical Physics, vol.80, pp.487-496, 1995.

A. Van-gelder, Cnfgen formula generator, 1993.

T. W. Sat and . Csp, Proceedings of the International Conference on Principles and Practice of Constraint Programming, pp.441-456, 2000.

M. Yagiura, Ramsey number problem generator, 1998.

S. Yang, Logic synthesis and optimization benchmarks user guide version 3.0. Microelectronics Center of North Carolina, 1991.