R. Lougee-heimer, The Common Optimization INterface for Operations Research: Promoting open-source software in the operations research community, IBM Journal of Research and Development, vol.47, issue.1, pp.57-66, 2003.
DOI : 10.1147/rd.471.0057

L. Liberti, Writing global optimization software Global Optimization: from Theory to Implementation, pp.211-262, 2006.

P. Belotti, J. Lee, L. Liberti, F. Margot, and A. Wächter, Branching and bounds tighteningtechniques for non-convex MINLP, Optimization Methods and Software, vol.24, issue.4-5, pp.597-634, 2009.
DOI : 10.1080/10556780903087124

H. Schichl and A. Neumaier, Interval Analysis on Directed Acyclic Graphs for Global Optimization, Journal of Global Optimization, vol.149, issue.1&2, pp.541-562, 2005.
DOI : 10.1007/s10898-005-0937-x

K. Fukuda and A. Prodon, Double description method revisited, 8th Franco-Japanese and 4th Franco-Chinese Conference on Combinatorics and Computer Science, pp.91-111, 1995.
DOI : 10.1007/3-540-61576-8_77

T. Christof and A. Löbel, The porta manual page, 1997.

N. Sahinidis and M. Tawarmalani, BARON 7.2.5: Global Optimization of Mixed- Integer Nonlinear Programs, User's Manual, 2005.

A. Brook, D. Kendrick, and A. Meeraus, GAMS, a user's guide, ACM SIGNUM Newsletter, vol.23, issue.3-4, pp.3-4, 1988.
DOI : 10.1145/58859.58863

D. Orban, R. Fourer, and . Dr, AMPL: a meta solver for optimization, 2004.

M. Colombo, A. Grothey, J. Hogg, K. Woodsend, and J. Gondzio, A structure-conveying modelling language for mathematical and stochastic programming, Mathematical Programming Computation, vol.21, issue.1, pp.223-247, 2009.
DOI : 10.1007/s12532-009-0008-2

S. Kucherenko, P. Belotti, L. Liberti, and N. Maculan, New formulations for the Kissing Number Problem, Discrete Applied Mathematics, vol.155, issue.14, pp.1837-1841, 2007.
DOI : 10.1016/j.dam.2006.05.012

URL : https://hal.archives-ouvertes.fr/inria-00123758

N. Maculan, P. Michelon, and J. Macgregor-smith, Bounds on the kissing numbers in R n : Mathematical programming formulations, 1996.

P. Gill, User's guide for SNOPT version 7, 2006.

L. Liberti, Symmetry in Mathematical Programming
DOI : 10.1007/978-1-4614-1927-3_9

C. Bachoc and F. Vallentin, New upper bounds for kissing numbers from semidefinite programming, Journal of the American Mathematical Society, vol.21, issue.3, pp.909-924, 2008.
DOI : 10.1090/S0894-0347-07-00589-9

URL : https://hal.archives-ouvertes.fr/hal-00196156

L. Liberti, Reformulations in Mathematical Programming: Definitions and Systematics, RAIRO - Operations Research, vol.43, issue.1, pp.55-86, 2009.
DOI : 10.1051/ro/2009005

L. Liberti, S. Cafieri, and F. Tarissan, Reformulations in Mathematical Programming: A Computational Approach, Number 203 in Studies in Computational Intelligence, pp.153-234, 2009.
DOI : 10.1007/978-3-642-01085-9_7

URL : https://hal.archives-ouvertes.fr/hal-01217899

R. Fortet, Applications de l'algèbre de Boole en recherche opérationelle. Revue Française de, Recherche Opérationelle, vol.4, pp.17-26, 1960.
DOI : 10.1007/bf03006558

E. Smith and C. Pantelides, A symbolic reformulation/spatial branch-and-bound algorithm for the global optimisation of nonconvex MINLPs, Computers & Chemical Engineering, vol.23, issue.4-5, pp.457-478, 1999.
DOI : 10.1016/S0098-1354(98)00286-5

D. 'ambrosio, C. Frangioni, A. Liberti, L. Lodi, and A. , Experiments with a feasibility pump approach for nonconvex MINLPs, Symposium on Experimental Algorithms, 2010.

M. Fischetti and A. Lodi, Local branching, Mathematical Programming, vol.98, issue.1-3, pp.23-37, 2005.
DOI : 10.1007/s10107-003-0395-5

B. Mckay, nauty User's Guide (Version 2.4), 2007.

G. The and . Group, GAP ? Groups, Algorithms, and Programming, Version 4.4.10, 2007.

L. Liberti, Spherical cuts for integer programming problems, International Transactions in Operational Research, vol.42, issue.1, pp.283-294, 2008.
DOI : 10.1007/s10107-003-0394-6

S. Cafieri, J. Lee, and L. Liberti, Comparison of convex relaxations of quadrilinear terms Global Optimization: Theory, Methods and Applications I, Lecture Notes in Decision Sciences, vol.12, pp.999-1005, 2009.

S. Cafieri, J. Lee, and L. Liberti, On convex relaxations of quadrilinear terms, Journal of Global Optimization, vol.99, issue.2
DOI : 10.1007/s10898-009-9484-1

L. Liberti, Reformulations in mathematical programming: automatic symmetry detection and exploitation, Mathematical Programming
DOI : 10.1007/s10107-010-0351-0

A. Costa, P. Hansen, and L. Liberti, Formulation symmetries in circle packing, Proceedings of the International Symposium on Combinatorial Optimization
DOI : 10.1016/j.endm.2010.05.165

A. Costa, P. Hansen, and L. Liberti, Static symmetry breaking in circle packing, Proceedings of the 8 th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010.

L. Liberti, N. Mladenovi´cmladenovi´c, and G. Nannicini, A Good Recipe for Solving MINLPs, Annals of Information Systems, vol.10, pp.231-244, 2009.
DOI : 10.1007/978-1-4419-1306-7_9