W. P. Adams and H. D. Sherali, A tight linearization and an algorithm for, pp.0-1

C. S. Adjiman, Global Optimization Techniques for Process Systems Engineering, 1998.

C. S. Adjiman, I. P. Androulakis, and C. A. Floudas, Global optimization of MINLP problems in process synthesis and design, Computers & Chemical Engineering, vol.21, pp.445-450, 1997.
DOI : 10.1016/S0098-1354(97)87542-4

C. S. Adjiman, I. P. Androulakis, and C. A. Floudas, A global optimization method, ??BB, for general twice-differentiable constrained NLPs???II. Implementation and computational results, Computers & Chemical Engineering, vol.22, issue.9, pp.1159-1179, 1998.
DOI : 10.1016/S0098-1354(98)00218-X

C. S. Adjiman, S. Dallwig, C. A. Floudas, and A. Neumaier, A global optimization method, ??BB, for general twice-differentiable constrained NLPs ??? I. Theoretical advances, Computers & Chemical Engineering, vol.22, issue.9, pp.1137-1158, 1998.
DOI : 10.1016/S0098-1354(98)00027-1

G. Agarwal and D. Kempe, Modularity-maximizing graph communities via mathematical programming, The European Physical Journal B, vol.66, issue.3, pp.409-418, 2008.
DOI : 10.1140/epjb/e2008-00425-1
URL : http://arxiv.org/pdf/0710.2533v3.pdf

F. A. and J. E. Falk, Jointly constrained biconvex programming, Mathematics of Operations Research, vol.8, issue.2, pp.273-286, 1983.

A. Alonso-ayuso, L. F. Escudero, and F. J. Martín-campo, Collision Avoidance in Air Traffic Management: A Mixed-Integer Linear Optimization Approach, IEEE Transactions on Intelligent Transportation Systems, vol.12, issue.1, pp.47-57, 2011.
DOI : 10.1109/TITS.2010.2061971

A. Alonso-ayuso, L. F. Escudero, and F. J. Martín-campo, A mixed 0???1 nonlinear optimization model and algorithmic approach for the collision avoidance in ATM: Velocity changes through a time horizon, Computers and Operations Research, 2012.
DOI : 10.1016/j.cor.2012.03.015

E. D. Andersen, J. Gondzio, C. Meszaros, and X. Xu, Implementation of interior point methods for large scale linear programming, Interior Point Methods in Mathematical Programming, pp.189-252, 1996.

I. P. Androulakis, C. D. Maranas, and C. A. , ?BB: A global optimization method for general constrained nonconvex problems, Journal of Global Optimization, vol.3, issue.3, pp.337-363, 1995.
DOI : 10.1007/BF01099647

M. Aps, The mosek optimization tools version 3.1 (revision 28) Users manual and reference, 2002.

S. Balram, Crude transshipment via floating, production, storage and offloading platforms, 2010.
DOI : 10.1016/s1570-7946(09)70738-2

A. Barabasi and R. Albert, Emergence of scaling in random networks, Science, vol.286, issue.5439, pp.509-512, 1999.

P. Belotti, J. Lee, L. Liberti, F. Margot, and A. Wächter, Branching and bounds tightening techniques for non-convex MINLP. Optimization Methods and Software, pp.597-634, 2009.

M. Benzi, G. Golub, and J. Liesen, Numerical solution of saddle point problems, Acta Numerica, vol.14
DOI : 10.1017/S0962492904000212

M. Benzi and V. Simoncini, On the eigenvalues of a class of saddle point matrices, Numerische Mathematik, vol.103, issue.2, pp.173-196, 2006.
DOI : 10.1007/s00211-006-0679-9

L. Bergamaschi, J. Gondzio, M. Venturin, and G. Zilli, Inexact constraint preconditioners for linear systems arising in interior point methods, Computational Optimization and Applications, vol.5, issue.2-3, pp.137-147, 2007.
DOI : 10.1007/s10589-006-9001-0

L. Bergamaschi, J. Gondzio, and G. Zilli, Preconditioning Indefinite Systems in Interior Point Methods for Optimization, Computational Optimization and Applications, vol.28, issue.2, pp.149-171, 2004.
DOI : 10.1023/B:COAP.0000026882.34332.1b

. Sastry, Decentralized air traffic management systems: performance and fault tolerance Extending the QCR method to general mixed-integer programs, Proceedings of IFAC International Workshop on Motion Control Mathematical Programming, pp.279-284381, 1998.

V. D. Blondel, J. Guillaume, R. Lambiotte, and E. Lefebvre, Fast unfolding of communities in large networks, Journal of Statistical Mechanics: Theory and Experiment, vol.2008, issue.10, 2008.
DOI : 10.1088/1742-5468/2008/10/P10008
URL : https://hal.archives-ouvertes.fr/hal-01146070

D. Bonini, C. Dupré, and G. Granger, How ERASMUS can support an increase in capacity in 2020, Proceedings of the 7th International Conference on Computing, Communications and Control Technologies: CCCT 2009, 2009.

U. Brandes, D. Delling, M. Gaertler, R. Görke, M. Hoefer et al., On Modularity Clustering, IEEE Transactions on Knowledge and Data Engineering, vol.20, issue.2, pp.172-188, 2008.
DOI : 10.1109/TKDE.2007.190689
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.6623

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

S. Cafieri, On the application of iterative solvers to KKT systems in Interior Point methods for Large-Scale Quadratic Programming problems, 2006.

S. Cafieri, Aircraft conflict avoidance: a mixed-integer nonlinear optimization approach, Proceedings of the Global Optimization Workshop (GOW'12), pp.43-46
URL : https://hal.archives-ouvertes.fr/hal-00938762

S. Cafieri and N. Durand, A mixed-integer optimization model for air traffic deconfliction, Proceedings of the Toulouse Global Optimization workshop, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00938717

A. Clauset, M. E. Newman, and C. Moore, Finding community structure in very large networks, Physical Review E, vol.70, issue.6, p.66111, 2004.
DOI : 10.1103/PhysRevE.70.066111
URL : http://arxiv.org/abs/cond-mat/0408187

A. Costa and L. Liberti, Relaxations of Multilinear Convex Envelopes: Dual Is Better Than Primal, Experimental Algorithms (Proceedings of SEA 2012), pp.87-98, 2012.
DOI : 10.1007/978-3-642-30850-5_9

L. Danon, A. Diaz-guilera, and A. Arenas, The effect of size heterogeneity on community identification in complex networks, Journal of Statistical Mechanics: Theory and Experiment, vol.2006, issue.11, 2006.
DOI : 10.1088/1742-5468/2006/11/P11010

H. Dollar and A. Wathen, Incomplete factorization constraint preconditioners for saddle-point matrices. Numerical Analysis Group, 2004.
DOI : 10.1137/04060768x
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.106.3794

H. S. Dollar and A. J. Wathen, Approximate Factorization Constraint Preconditioners for Saddle-Point Matrices, SIAM Journal on Scientific Computing, vol.27, issue.5, pp.1555-1572, 2006.
DOI : 10.1137/04060768X

O. Du-merle, D. Villeneuve, J. Desrosiers, and P. Hansen, Stabilized column generation, Discrete Mathematics, vol.194, issue.1-3, pp.229-237, 1999.
DOI : 10.1016/S0012-365X(98)00213-1

N. Durand and J. M. Alliot, Optimal resolution of en-route conflict, Proceedings of the Eurocontrol, 1997.

N. Durand and J. M. Alliot, Ant-colony optimization for air traffic conflict resolution, Proceedings of the Eighth USA/Europe Air Traffic Management Research and Development Seminar, 2009.
URL : https://hal.archives-ouvertes.fr/hal-01293554

N. Durand, J. M. Alliot, and F. Medioni, Neural nets trained by genetic algorithms for collision avoidance, Applied Artificial Intelligence, vol.13, issue.3, pp.205-213, 2000.
URL : https://hal.archives-ouvertes.fr/hal-00934535

N. Durand, J. M. Alliot, and J. Noailles, Automatic aircraft conflict resolution using genetic algorithms, Proceedings of the 1996 ACM symposium on Applied Computing , SAC '96, 1996.
DOI : 10.1145/331119.331195
URL : https://hal.archives-ouvertes.fr/hal-00937685

C. Durazzi and V. Ruggiero, Indefinitely preconditioned conjugate gradient method for large sparse equality and inequality constrained quadratic problems. Numerical Linear Algebra with Applications, pp.673-688, 2003.

N. Etoundi, T. Labarre, C. Martin, and V. Steyaert, Analyse d'un réseau de transport aérien. Rapport final, 2010.

C. A. Floudas, Deterministic Global Optimization: Theory, Methods and Applications . Nonconvex Optimization and Its Applications, 1999.
DOI : 10.1007/978-1-4757-4949-6

C. A. Floudas, Global optimization in design and control of chemical process systems, Journal of Process Control, vol.10, issue.2-3, pp.125-134, 2001.
DOI : 10.1016/S0959-1524(99)00019-0

A. Forsgren, P. E. Gill, and J. D. Griffin, Iterative Solution of Augmented Systems Arising in Interior Methods, SIAM Journal on Optimization, vol.18, issue.2, pp.666-690, 2007.
DOI : 10.1137/060650210

A. Forsgren, P. E. Gill, and J. R. Shinnerl, Stability of Symmetric Ill-Conditioned Systems Arising in Interior Methods for Constrained Optimization, SIAM Journal on Matrix Analysis and Applications, vol.17, issue.1, pp.187-211, 1996.
DOI : 10.1137/S0895479894270658

S. Fortunato, Community detection in graphs, Physics Reports, vol.486, issue.3-5, pp.75-174, 2010.
DOI : 10.1016/j.physrep.2009.11.002

S. Fortunato and M. Barthelemy, Resolution limit in community detection, Proceedings of the National Academy of Sciences, vol.104, issue.1, pp.36-41, 2007.
DOI : 10.1073/pnas.0605965104

R. Fourer, D. Gay, A. The, ]. A. Book49, H. Fügenschuh et al., Mixed-integer nonlinear problems in transportation applications, Proceedings of the 2nd International Conference on Engineering Optimization, 2002.

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979.

E. M. Gertz and S. J. Wright, Object-Oriented Software for Quadratic Pro- gramming

M. Girvan and M. Newman, Community structure in social and biological networks, Proceedings of the National Academy of Sciences, pp.997821-7826, 2002.
DOI : 10.1073/pnas.122653799

G. H. Golub and A. J. Wathen, An Iteration for Indefinite Systems and Its Application to the Navier--Stokes Equations, SIAM Journal on Scientific Computing, vol.19, issue.2, pp.530-539, 1998.
DOI : 10.1137/S106482759529382X

J. Gondzio, Interior point methods 25 years later, European Journal of Operational Research, vol.218, issue.3, pp.587-601, 2011.
DOI : 10.1016/j.ejor.2011.09.017
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.406.6083

B. H. Good, Y. De-montjoye, and A. Clauset, Performance of modularity maximization in practical contexts, Physical Review E, vol.81, issue.4, p.46106, 2010.
DOI : 10.1103/PhysRevE.81.046106

C. E. Gounaris and C. A. Floudas, Tight convex underestimators for $${\mathcal{C}^2}$$ -continuous problems: II. multivariate functions, Journal of Global Optimization, vol.23, issue.1, pp.69-89, 2008.
DOI : 10.1007/s10898-008-9288-8

C. E. Gounaris and C. A. Floudas, Tight convex underestimators for $${{\mathcal C}^2}$$ -continuous problems: I. univariate functions, Journal of Global Optimization, vol.93, issue.1, pp.51-67, 2008.
DOI : 10.1007/s10898-008-9287-9

G. Granger and N. Durand, A traffic complexity approach through cluster analysis, Proceedings of the 5th ATM R&D Seminar, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00938044

M. Grötschel and Y. Wakabayashi, A cutting plane algorithm for a clustering problem, Mathematical Programming, vol.7, issue.1-3, pp.59-96, 1989.
DOI : 10.1007/BF01589097

M. Grötschel and Y. Wakabayashi, Facets of the clique partitioning polytope, Mathematical Programming, vol.7, issue.1-3, pp.367-387, 1990.
DOI : 10.1007/BF01580870

R. Guimerà and A. N. Amaral, Functional cartography of complex metabolic networks, Nature, vol.220, issue.7028, pp.895-900, 2005.
DOI : 10.1038/35075138

R. Guimera, S. Mossa, A. Turtschi, and A. N. Amaral, The worldwide air transportation network: Anomalous centrality, community structure, and cities' global roles, Proc. Natl. Acad. Sci. USA, pp.7794-7799, 2005.
DOI : 10.1073/pnas.0407994102

P. Hansen, B. Jaumard, and C. Meyer, A simple enumerative algorithm for unconstrained 0?1 quadratic programming. Les Cahiers du GERAD, 2000.

P. Hansen and N. Mladenovic, Variable neighborhood search: Principles and applications, European Journal of Operational Research, vol.130, issue.3, pp.449-467, 2001.
DOI : 10.1016/S0377-2217(00)00100-4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.93.1769

S. Huang, M. Aydin, and T. A. Lipo, A direct approach to electrical machine performance evaluation: Torque density assessment and sizing optimisation, International Conference on Electrical Machines, p.235, 2002.

B. Jeannet and F. Messine, Extensions of interval branch-and-bound algorithms for mixed global optimization problems with real and categorical variables, Toulouse Global Optimization Workshop, pp.67-70, 2010.

Y. Jiao, F. H. Stillinger, and S. Torquato, Geometrical ambiguity of pair statistics: Point configurations, Physical Review E, vol.81, issue.1, 2009.
DOI : 10.1103/PhysRevE.81.011105

J. Kallrath, Solving Planning and Design Problems in the Process Industry Using Mixed Integer and Global Optimization, Annals of Operations Research, vol.122, issue.2, pp.339-373, 2005.
DOI : 10.1007/s10479-005-3976-2

N. Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica, vol.244, issue.S, pp.373-395, 1984.
DOI : 10.1007/BF02579150

C. Keller, N. Gould, and A. Wathen, Constraint Preconditioning for Indefinite Linear Systems, SIAM Journal on Matrix Analysis and Applications, vol.21, issue.4, pp.1300-1317, 2000.
DOI : 10.1137/S0895479899351805
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.27.4367

B. W. Kernighan and S. Lin, An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, pp.291-307, 1970.

D. E. Knuth, The Stanford GraphBase: A Platform for Combinatorial Computing

J. Kuchar and L. Yang, A review of conflict detection and resolution modeling methods, IEEE Transactions on Intelligent Transportation Systems, vol.1, issue.4, pp.179-189066122, 2000.
DOI : 10.1109/6979.898217

C. Lavor, L. Liberti, N. Maculan, and M. A. Nascimento, Solving Hartree-Fock systems with global optimization methods, Europhysics Letters (EPL), vol.77, issue.5, p.50006, 2007.
DOI : 10.1209/0295-5075/77/50006

R. D. Lazarov and P. S. Vassilevski, Preconditioning saddle-point problems arising from mixed finite element discretizations of elliptic equations. Numerical Linear Algebra with Applications, pp.1-20, 1996.

J. Lee, W. D. Morris, and J. , Geometric comparison of combinatorial polytopes, Discrete Applied Mathematics, vol.55, issue.2, pp.163-182, 1994.
DOI : 10.1016/0166-218X(94)90006-X

A. Letchford and S. Burer, Non-convex mixed-integer nonlinear programming: a survey, Surveys in Operations Research and Management Science, 2012.

L. Liberti, Linearity Embedded in Nonconvex Programs, Journal of Global Optimization, vol.23, issue.5, pp.157-196, 2005.
DOI : 10.1007/s10898-004-0864-2

L. Liberti, Writing Global Optimization Software, Global Optimization: from Theory to Implementation, pp.211-262, 2006.
DOI : 10.1007/0-387-30528-9_8

L. Liberti, Reformulation techniques in mathematical programming, Thèse d'HabilitationàHabilitationà Diriger des Recherches, 2007.
DOI : 10.1016/j.dam.2008.10.016
URL : https://hal.archives-ouvertes.fr/hal-00163563

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, Reformulations in mathematical programming: automatic symmetry detection and exploitation, Mathematical Programming, vol.174, issue.10, pp.273-304, 2012.
DOI : 10.1007/s10107-010-0351-0

L. Liberti, Symmetry in Mathematical Programming, Mixed Integer Nonlinear Programming, IMA Series
DOI : 10.1007/978-1-4614-1927-3_9
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.191.589

L. Liberti, C. Lavor, and N. Maculan, A Branch-and-Prune algorithm for the Molecular Distance Geometry Problem, International Transactions in Operational Research, vol.23, issue.13, pp.1-17, 2008.
DOI : 10.1111/j.1475-3995.2007.00622.x

L. Liberti, C. Lavor, A. Mucherino, and N. Maculan, Molecular distance geometry methods: from continuous to discrete, International Transactions in Operational Research, vol.43, issue.3, pp.33-51, 2010.
DOI : 10.1111/j.1475-3995.2009.00757.x

L. Liberti and C. Pantelides, An Exact Reformulation Algorithm for Large Nonconvex NLPs Involving Bilinear Terms, Journal of Global Optimization, vol.3, issue.10, pp.161-189, 2006.
DOI : 10.1007/s10898-006-9005-4

L. Liberti and C. C. Pantelides, Convex envelopes of monomials of odd degree, Journal of Global Optimization, vol.25, issue.2, pp.157-168, 2003.
DOI : 10.1023/A:1021924706467

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. Luksan and J. Vlcek, Indefinitely preconditioned inexact Newton method for large sparse equality constrained non-linear programming problems, Numerical Linear Algebra with Applications, vol.3, issue.3, pp.219-247, 1998.
DOI : 10.1002/(SICI)1099-1506(199805/06)5:3<219::AID-NLA134>3.0.CO;2-7

V. Maniezzo, T. Stutzle, and S. Voss, Hybridizing metaheuristics and mathematical programming, 2009.

C. P. Massen and J. P. Doye, Identifying communities within energy landscapes, Physical Review E, vol.71, issue.4, p.46101, 2005.
DOI : 10.1103/PhysRevE.71.046101
URL : http://arxiv.org/abs/cond-mat/0412469

G. P. Mccormick, Computability of global solutions to factorable nonconvex programs: Part I ??? Convex underestimating problems, Mathematical Programming, pp.146-175, 1976.
DOI : 10.1287/mnsc.17.11.759

A. D. Medus and C. O. Dorso, Alternative approach to community detection in networks, Physical Review E, vol.79, issue.6, p.66111, 2009.
DOI : 10.1103/PhysRevE.79.066111

F. Messine, Deterministic global optimization using interval constraint propagation techniques, RAIRO - Operations Research, vol.38, issue.4, pp.277-294, 2004.
DOI : 10.1051/ro:2004026

F. Messine, A Deterministic Global Optimization Algorithm for Design Problems, pp.267-292, 2005.
DOI : 10.1007/0-387-25570-2_10

F. Messine, A Deterministic Global Optimization Algorithm for Design Problems, Essays and Surveys in Global Optimization, pp.267-294, 2005.
DOI : 10.1007/0-387-25570-2_10

F. Messine and B. Nogaréde, Optimal Design of Multi-Airgap Electrical Machines: An Unknown Size Mixed-Constrained Global Optimization Formulation, IEEE Transactions on Magnetics, vol.42, issue.12, pp.3847-3853, 2006.
DOI : 10.1109/TMAG.2006.881100

F. Messine, B. Nogaréde, and J. L. Lagouanelle, Optimal design of electromechanical actuators: a new method based on global optimization, IEEE Transactions on Magnetics, vol.34, issue.1, pp.299-307, 1998.
DOI : 10.1109/20.650361

C. A. Meyer and C. A. Floudas, Trilinear Monomials with Positive or Negative Domains: Facets of the Convex and Concave Envelopes
DOI : 10.1007/978-1-4613-0251-3_18

. Pardalos, Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes, Frontiers in Global Optimization, pp.327-352125, 2003.

C. A. Meyer and C. A. Floudas, Convex envelopes for edge-concave functions, Mathematical Programming, pp.207-224, 2005.
DOI : 10.1007/s10107-005-0580-9

R. Misener and C. A. Floudas, Global optimization of mixed-integer quadraticallyconstrained quadratic programs (MIQCQP) through piecewise-linear and edgeconcave relaxations, Mathematical Programming B

S. Mizuno, M. Kojima, and M. J. Todd, Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming, SIAM Journal on Optimization, vol.5, issue.1, pp.52-67, 1995.
DOI : 10.1137/0805003

N. Mladenovic and P. Hansen, Variable neighborhood search, Computers & Operations Research, vol.24, issue.11, pp.1097-1100, 1997.
DOI : 10.1016/S0305-0548(97)00031-2
URL : https://hal.archives-ouvertes.fr/hal-00979295

P. Mosses, Denotational Semantics, pp.575-631, 1990.
DOI : 10.1016/B978-0-444-88074-1.50016-0

W. Murray and U. Shanbhag, A Local Relaxation Approach for the Siting of Electrical Substations, Computational Optimization and Applications, vol.33, issue.1, pp.7-49, 2006.
DOI : 10.1007/s10589-005-5957-4

P. Neittaanmki, M. Rudnicki, and A. Savini, Inverse Problems and Optimal Design in Electricity and Magnetism, 1996.

G. L. Nemhauser and L. A. Wolsey, Integer and Combinatorial Optimization, 1988.
DOI : 10.1002/9781118627372
URL : http://dx.doi.org/10.1016/s0898-1221(99)91259-2

M. Newman, Modularity and community structure in networks, Proceedings of the National Academy of Sciences, vol.103, issue.23, pp.8577-8582, 2006.
DOI : 10.1073/pnas.0601602103

M. Newman and M. Girvan, Finding and evaluating community structure in networks, Physical Review E, vol.69, issue.2, p.26133, 2004.
DOI : 10.1103/PhysRevE.69.026113

M. E. Newman, Finding community structure in networks using the eigenvectors of matrices, Physical Review E, vol.74, issue.3, p.36104, 2006.
DOI : 10.1103/PhysRevE.74.036104

M. E. Newman, Networks: an introduction, 2010.
DOI : 10.1093/acprof:oso/9780199206650.001.0001

M. E. Newman, Fast algorithm for detecting community structure in networks, Physical Review E, vol.69, issue.6, p.66133, 2004.
DOI : 10.1103/PhysRevE.69.066133

J. Ninin and F. Messine, A mixed affine reformulation method for global optimization, Toulouse Global Optimization Workshop, pp.101-104, 2010.

A. Noack and R. Rotta, Multi-level Algorithms for Modularity Clustering, Lecture Notes in Computer Science, vol.5526, pp.257-268, 2009.
DOI : 10.1007/978-3-642-02011-7_24

J. Nocedal and S. J. Wright, Numerical Optimization, 1999.
DOI : 10.1007/b98874

B. Nogaréde, A. D. Kone, and M. Lajoie-mazenc, Optimal design of permanentmagnet machines using analytical field modeling, Electromotion, vol.2, issue.1, pp.25-34, 1995.

D. P. Leary, Symbiosis between linear algebra and optimization, Journal of Computational and Applied Mathematics, vol.123, issue.1-2, pp.447-465, 2000.
DOI : 10.1016/S0377-0427(00)00408-8

L. Pallottino, E. Feron, and A. Bicchi, Conflict resolution problems for air traffic management systems solved with mixed integer programming, IEEE Transactions on Intelligent Transportation Systems, vol.3, issue.1, pp.3-11, 2002.
DOI : 10.1109/6979.994791

I. Perugia and V. Simoncini, Block-diagonal and indefinite symmetric preconditioners for mixed finite element formulations, Numerical Linear Algebra with Applications, vol.7, issue.7-8, pp.585-616, 2000.
DOI : 10.1002/1099-1506(200010/12)7:7/8<585::AID-NLA214>3.0.CO;2-F

F. Radicchi, C. Castellano, F. Cecconi, V. Loreto, and D. Parisi, Defining and identifying communities in networks, Proceedings of the National Academy of Sciences, vol.101, issue.9, pp.2658-2663, 2004.
DOI : 10.1073/pnas.0400054101

L. Rao, W. Yan, and R. He, Mean Field Annealing (MFA) and optimal design of electromagnetic devices, IEEE Transactions on Magnetics, vol.32, pp.1218-1221, 1996.

D. Rey, S. Constans, R. Fondacci, and C. Rapine, A mixed integer linear model for potential conflict minimization by speed modulations, Proceedings of the International Conference on Research in Air Transportation, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00520052

D. Rey, C. Rapine, R. Fondacci, and N. Faouzi, Potential air conflicts minimization through speed regulation [132] A. Rikun. A convex envelope formula for multilinear functions, Transportation Research Board Journal of Global Optimization, vol.10, issue.4, pp.425-437, 1997.

M. Rozloznik and V. Simoncini, Krylov Subspace Methods for Saddle Point Problems with Indefinite Preconditioning, SIAM Journal on Matrix Analysis and Applications, vol.24, issue.2, pp.368-391, 2002.
DOI : 10.1137/S0895479800375540

H. S. Ryoo and N. V. Sahinidis, Global optimization of nonconvex NLPs and MINLPs with applications in process design, Computers & Chemical Engineering, vol.19, issue.5, pp.551-566, 1995.
DOI : 10.1016/0098-1354(94)00097-2

H. S. Ryoo and N. V. Sahinidis, A branch-and-reduce approach to global optimization, Journal of Global Optimization, vol.22, issue.4, pp.107-138, 1996.
DOI : 10.1007/BF00138689

P. Schuetz and A. Caflisch, Efficient modularity optimization by multistep greedy algorithm and vertex mover refinement, Physical Review E, vol.77, issue.4, p.46112, 2008.
DOI : 10.1103/PhysRevE.77.046112
URL : http://arxiv.org/abs/0712.1163

H. Sherali, E. Dalkiran, and L. Liberti, Reduced RLT representations for nonconvex polynomial programming problems, Journal of Global Optimization, vol.103, issue.1, pp.447-469, 2012.
DOI : 10.1007/s10898-011-9757-3

H. Sherali and C. H. Tuncbilek, A global optimization algorithm for polynomial programming problems using a Reformulation-Linearization Technique, Journal of Global Optimization, vol.3, issue.1, pp.101-112, 1991.
DOI : 10.1007/BF00121304

H. Sherali and C. H. Tuncbilek, New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems, Operations Research Letters, vol.21, issue.1, pp.1-9, 1997.
DOI : 10.1016/S0167-6377(97)00013-8

H. D. Sherali, Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets, Acta Mathematica Vietnamica, vol.22, pp.245-270, 1997.

H. D. Sherali, Global optimization of nonconvex polynomial programming problems having rational exponents, Journal of Global Optimization, vol.12, issue.3, pp.267-283, 1998.
DOI : 10.1023/A:1008249414776

H. D. Sherali, Tight Relaxations for Nonconvex Optimization Problems Using the Reformulation-Linearization/Convexification Technique (RLT), Handbook of Global Optimization, pp.1-63
DOI : 10.1007/978-1-4757-5362-2_1

H. D. Sherali and W. P. Adams, A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems, 1999.
DOI : 10.1007/978-1-4757-4388-3

H. D. Sherali and A. Alameddine, A new reformulation-linearization technique for bilinear programming problems, Journal of Global Optimization, vol.21, issue.3, pp.379-410, 1992.
DOI : 10.1007/BF00122429

H. D. Sherali and H. Wang, Global optimization of nonconvex factorable programming problems, Mathematical Programming, vol.89, issue.3, pp.459-478, 2001.
DOI : 10.1007/PL00011409

G. R. Slemon and X. Liu, Modeling and design optimization of permanent magnet motors. Electric Machines and Power Systems, pp.71-92, 1992.

E. M. Smith, On the Optimal Design of Continuous Processes, 1996.

E. M. Smith and C. C. Pantelides, Global optimisation of nonconvex MINLPs, Computers & Chemical Engineering, vol.21, pp.791-796, 1997.
DOI : 10.1016/S0098-1354(97)87599-0

E. M. Smith and C. 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

K. Tanabe, Centered newton method for mathematical programming, System Modeling and Optimization: Proceedings of the 13th IFIP Conference, Lecture Notes in Control and Information Systems, pp.197-206
DOI : 10.1007/BFb0042787

F. Tardella, Existence and sum decomposition of vertex polyhedral convex envelopes, Optimization Letters, vol.93, issue.3, pp.363-375, 2008.
DOI : 10.1007/s11590-007-0065-2

F. Tardella, On the existence of polyhedral convex envelopes, Frontiers in Global Optimization, pp.149-188, 2008.
DOI : 10.1007/978-1-4613-0251-3_30

M. Tawarmalani and N. V. Sahinidis, Convex extensions and envelopes of lower semi-continuous functions, Mathematical Programming, pp.247-263, 2002.
DOI : 10.1007/s10107-002-0308-z

M. Tawarmalani and N. V. Sahinidis, Global optimization of mixed-integer nonlinear programs: A theoretical and computational study, Mathematical Programming, pp.563-591, 2004.
DOI : 10.1007/s10107-003-0467-6

M. J. Todd158-]-m, Y. Todd, and . Ye, A centered projective algorithm for linear programming, Potential-Reduction Methods in Mathematical Programming. Mathematical Programming Mathematics of Operations Research, vol.76, issue.15, pp.3-45508, 1990.

C. Tomlin, G. J. Pappas, and S. S. Sastry, Conflict resolution for air traffic management: a study in multiagent hybrid systems, IEEE Transactions on Automatic Control, vol.43, issue.4, pp.509-521, 1998.
DOI : 10.1109/9.664154

H. D. Tuy, D.C. Optimization: Theory, Methods and Algorithms, Handbook of Global Optimization, pp.149-216
DOI : 10.1007/978-1-4615-2025-2_4

F. Vanderbeck and M. W. Savelsbergh, A generic view of Dantzig???Wolfe decomposition in mixed integer programming, Operations Research Letters, vol.34, issue.3, pp.296-306, 2006.
DOI : 10.1016/j.orl.2005.05.009
URL : https://hal.archives-ouvertes.fr/inria-00342623

R. J. Vanderbei, Symmetric Quasidefinite Matrices, SIAM Journal on Optimization, vol.5, issue.1, pp.100-113, 1995.
DOI : 10.1137/0805005
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.366.3155

R. J. Vanderbei, LOQO user's manual ??? version 3.10, Optimization Methods and Software, vol.87, issue.1-4, 1997.
DOI : 10.1023/A:1008677427361
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.140.8337

A. Vela, S. Solak, W. Singhose, and J. Clarke, A mixed integer program for flight-level assignment and speed control for conflict resolution, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference, 2009.
DOI : 10.1109/CDC.2009.5400520

K. Wakita and T. Tsurumi, Finding community structure in mega-scale social networks, Proceedings of the 16th international conference on World Wide Web , WWW '07, 2007.
DOI : 10.1145/1242572.1242805

J. Wang, Y. Qui, R. Wang, and X. Zhang, Remarks on Network Community Properties, Journal of Systems Science and Complexity, vol.105, issue.23, pp.637-644, 2008.
DOI : 10.1007/s11424-008-9140-8

D. S. Watts and S. H. Strogatz, Collective dynamics of 'small-world' networks, Nature, vol.393, issue.6684, pp.409-410, 1998.

M. H. Wright, Ill-Conditioning and Computational Error in Interior Methods for Nonlinear Programming, SIAM Journal on Optimization, vol.9, issue.1, pp.84-111, 1998.
DOI : 10.1137/S1052623497322279

S. J. Wright, Primal-Dual Interior-Point Methods. SIAM, 1997.
DOI : 10.1137/1.9781611971453
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.129.5633

S. J. Wright, Stability of Augmented System Factorizations in Interior-Point Methods, SIAM Journal on Matrix Analysis and Applications, vol.18, issue.1, pp.191-222, 1997.
DOI : 10.1137/S0895479894271093

F. Wurtz, J. Bigeon, and C. Poirson, A methodology and a tool for the computer aided design with constraints of electrical devices, IEEE Transactions on Magnetics, vol.32, issue.3, pp.1429-1432, 1996.
DOI : 10.1109/20.497516

G. Xu, S. Tsoka, and L. G. Papageorgiou, Finding community structures in complex networks using mixed integer optimisation, The European Physical Journal B, vol.579, issue.2, pp.231-239, 2007.
DOI : 10.1140/epjb/e2007-00331-0

W. W. Zachary, An Information Flow Model for Conflict and Fission in Small Groups, Journal of Anthropological Research, vol.33, issue.4, pp.452-473, 1977.
DOI : 10.1086/jar.33.4.3629752

S. Cafieri, P. Hansen, and L. Liberti, Improving heuristics for network modularity maximization using an exact algorithm, Discrete Applied Mathematics, vol.163, 2012.
DOI : 10.1016/j.dam.2012.03.030
URL : https://hal.archives-ouvertes.fr/hal-00935211

S. Cafieri, G. Caporossi, P. Hansen, S. Perron, and A. Costa, Finding communities in networks in the strong and almost-strong sense, Physical Review E, vol.85, issue.4, p.46113, 2012.
DOI : 10.1103/PhysRevE.85.046113
URL : https://hal.archives-ouvertes.fr/hal-00935213

S. Cafieri, P. Hansen, and L. Liberti, Locally optimal heuristic for modularity maximization of networks, Physical Review E, vol.83, issue.5, p.56105, 2011.
DOI : 10.1103/PhysRevE.83.056105
URL : https://hal.archives-ouvertes.fr/hal-00934660

D. Aloise, S. Cafieri, G. Caporossi, P. Hansen, L. Liberti et al., Column generation algorithms for exact modularity maximization in networks, Physical Review E, vol.82, issue.4, p.46112, 2010.
DOI : 10.1103/PhysRevE.82.046112
URL : https://hal.archives-ouvertes.fr/hal-00934661

S. Cafieri, P. Hansen, and L. Liberti, Loops and multiple edges in modularity maximization of networks, Physical Review E, vol.81, issue.4, p.46102, 2010.
DOI : 10.1103/PhysRevE.81.046102
URL : https://hal.archives-ouvertes.fr/hal-00979205

S. Cafieri, P. Hansen, and L. Liberti, Edge ratio and community structure in networks, structure in networks, p.26105, 2010.
DOI : 10.1103/PhysRevE.81.026105
URL : https://hal.archives-ouvertes.fr/hal-00935207

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

S. Cafieri, M. Mastromatteo, S. Chillo, and M. A. Del-nobile, Modeling the mechanical properties of pasta cooked at different times, Journal of Food Engineering, vol.100, issue.2, pp.336-342, 2010.
DOI : 10.1016/j.jfoodeng.2010.04.019

S. Cafieri, S. Chillo, M. Mastromatteo, N. Suriano, and M. A. Del-nobile, A mathematical model to predict the effect of shape on pasta hydration kinetic during cooking and overcooking, Journal of Cereal Science, vol.48, issue.3, pp.857-862, 2008.
DOI : 10.1016/j.jcs.2008.06.010

S. Cafieri, M. D. Apuzzo, V. De-simone, D. Di-serafino, and G. Toraldo, Convergence Analysis of an Inexact Potential Reduction Method for Convex Quadratic Programming, Journal of Optimization Theory and Applications, vol.129, issue.1, pp.355-366, 2007.
DOI : 10.1007/s10957-007-9264-3

S. Cafieri, M. D. Apuzzo, V. De-simone, and D. Di-serafino, Stopping criteria for inner iterations in inexact Potential Reduction methods: a computational study, Computational Optimization and Applications, special issue on Linear Algebra issues arising in Interior Point methods

S. Cafieri, M. D. Apuzzo, V. De-simone, and D. Di-serafino, On the Iterative Solution of KKT Systems in Potential Reduction Software for Large Scale Quadratic Problems, Computational Optimization and Applications, special issue on High Performance Algorithms and Software for Nonlinear Optimization, pp.27-45, 2007.

S. Cafieri, M. D. Apuzzo, M. Marino, A. Mucherino, and G. Toraldo, Interior-Point Solver for Large-Scale Quadratic Programming Problems with Bound Constraints, Journal of Optimization Theory and Applications, vol.55, issue.4, pp.55-75, 2006.
DOI : 10.1007/s10957-006-9043-6

S. Cafieri and U. , Graphs and Combinatorial Optimization , special issue of Discrete Applied Mathematics dedicated to the 17, Proceedings of the Toulouse Global Optimization workshop (TOGO10), 2010.

P. Belotti, S. Cafieri, J. Lee, L. Liberti, and A. Miller, On the Composition of Convex Envelopes for Quadrilinear Terms, Proceedings of the International Conference on Optimization, Simulation and Control, Series : Springer Optimization and its Application
DOI : 10.1007/978-1-4614-5131-0_1
URL : https://hal.archives-ouvertes.fr/hal-00769671

L. Cellier, S. Cafieri, and F. Messine, Hybridizing direct and indirect optimal control approaches for aircraft conflict avoidance, Proceedings of ADV- COMP 2012: The Sixth International Conference on Advanced Engineering Computing and Applications in Sciences, pp.42-45, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00938826

S. Cafieri, Aircraft conflict avoidance: A mixed-integer nonlinear optimization approach, Proceedings of Global Optimization Workshop (GOW'12), pp.43-46
URL : https://hal.archives-ouvertes.fr/hal-00938762

S. Cafieri, P. Hansen, L. Létocart, L. Liberti, and F. Messine, Compact Relaxations for Polynomial Programming Problems, Experimental Algorithms (Proceedings of SEA 2012), pp.75-86, 2012.
DOI : 10.1007/978-3-642-30850-5_8
URL : https://hal.archives-ouvertes.fr/hal-00938524

P. Belotti, S. Cafieri, L. Liberti, and J. Lee, Feasibility-Based Bounds Tightening via Fixed Points, Proceedings of Conference on Combinatorial Optimization and Applications, pp.65-76, 2010.
DOI : 10.1007/978-3-642-17458-2_7
URL : https://hal.archives-ouvertes.fr/hal-00979219

S. Cafieri, L. Liberti, F. Messine, and B. Nogarede, Discussion about formulations and resolution techniques of electrical machine design problems, The XIX International Conference on Electrical Machines, ICEM 2010, 2010.
DOI : 10.1109/ICELMACH.2010.5607836
URL : https://hal.archives-ouvertes.fr/hal-00938437

S. Cafieri, P. Brisset, and N. Durand, A mixed-integer optimization model for Air Traffic Deconfliction, Proceedings of Toulouse Global Optimization workshop (TOGO) 2010, pp.27-30, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00938717

L. Liberti, S. Cafieri, and D. Savourey, The Reformulation-Optimization Software Engine, International Congress of Mathematical Software (ICMS), pp.303-314, 2010.
DOI : 10.1007/978-3-642-15582-6_50
URL : https://hal.archives-ouvertes.fr/hal-00979214

S. Cafieri, P. Hansen, and L. Liberti, Improving heuristics for network modularity maximization using an exact algorithm, Discrete Applied Mathematics, vol.163, pp.130-139, 2010.
DOI : 10.1016/j.dam.2012.03.030
URL : https://hal.archives-ouvertes.fr/hal-00935211

P. Belotti, S. Cafieri, J. Lee, and L. Liberti, On the convergence of feasibility based bounds tightening, Proceedings of CTW 2010, pp.21-24, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00940949

S. Cafieri, P. Hansen, L. Létocart, L. Liberti, and F. Messine, Reduced RLT constraints for polynomial programming, Proceedings of European Workshop on MINLP 2010, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00938438

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, M. D. Apuzzo, V. De-simone, and D. Di-serafino, ON THE USE OF AN APPROXIMATE CONSTRAINT PRECONDITIONER IN A POTENTIAL REDUCTION ALGORITHM FOR QUADRATIC PROGRAMMING, Applied and Industrial Mathematics in Italy II, 2007.
DOI : 10.1142/9789812709394_0020

L. Cellier, S. Cafieri, and F. Messine, Résolution de conflit aérien par contrôle optimal basé sur la régulation en vitesse, Proceedings of ROADEF 2012, 2012.

S. Cafieri, A. Gondran, and S. U. Ngueveu, Un algorithme mémétique pour construire des trajectoires d'aéronefs robustes aux aléas météorologiques, Proceedings of ROADEF 2012 Proceedings of ROADEF 2012, 2012.

A. Costa, S. Cafieri, and P. Hansen, Reformulation of a locally optimal heuristic for modularity maximization, Proceedings of ROADEF 2012, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00934798

S. Cafieri, P. Hansen, and L. Liberti, Hierarchical clustering for the identification of communities in networks, Proceedings of ROADEF 2011, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00934763

D. Aloise, S. Cafieri, G. Caporossi, P. Hansen, L. Liberti et al., Algorithms for network modularity maximization, Proceedings of ROADEF 2010, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00934772

L. Liberti, S. Cafieri, and J. Lee, Range reduction using fixed points, Proceedings of ROADEF 2010, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00934795

S. Cafieri, J. Lee, and L. Liberti, On convex relaxations of quadrilinear terms, Proceedings of ROADEF 09, 2009.
DOI : 10.1007/s10898-009-9484-1

S. Cafieri, P. Hansen, and L. Liberti, Reformulations between structured global optimization problems and algorithms, Proceedings of ROADEF 09, 2009.

S. Cafieri and N. Durand, Aircraft deconfliction with speed regulation: new models from mixed-integer optimization, Optimization Online preprint n, 2012.

P. Belotti, S. Cafieri, J. Lee, and L. Liberti, On feasibility based bounds tightening, Optimization Online preprint n, 2012.
DOI : 10.1007/978-3-642-17458-2_7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.174.1201

S. Cafieri, A. Costa, and P. Hansen, Reformulation of a model for hierarchical divisive graph modularity maximization, Optimization Online preprint n, 2011.

A. Mucherino and S. Cafieri, A New Heuristic for Feature Selection by Consistent Biclustering, arXiv e-print, 2010.

S. Cafieri, Ottimizzazione quadratica: algoritmi e software per problemi sparsi, 2001.

@. Euro-xxv-, Aircraft conflict avoidance: a mixed-integer nonlinear optimization approach, European conference on Operations Research, 2012.

@. Gow-', 12 -Global Optimization Workshop Aircraft conflict avoidance: a mixed-integer nonlinear optimization approach, 2012.

@. Afg-', 11 -15th Austrian-French-German conference on Optimization Reduced RLT compact relaxations for polynomial programming, 2011.

@. Lri, U. Paris, and X. , 1 seminar, invited by A. Lisser. Seminar: Convex relaxations in Branch and Bound global optimization methods: quadrilinear terms, 2009.

. Cellier, Hybridizing direct and indirect optimal control approaches for aircraft conflict avoidance, ADVCOMP 2012: The Sixth International Conference on Advanced Engineering Computing and Applications in Sciences, pp.42-45, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00938826

. Cafieri, Locally optimal heuristic for modularity maximization of networks, Physical Review E, vol.83, issue.5, p.56105, 2011.
DOI : 10.1103/PhysRevE.83.056105
URL : https://hal.archives-ouvertes.fr/hal-00934660

. Cafieri, Edge ratio and community structure in networks, Physical Review E, vol.81, issue.2, p.26105, 2010.
DOI : 10.1103/PhysRevE.81.026105
URL : https://hal.archives-ouvertes.fr/hal-00935207

. Cafieri, Loops and multiple edges in modularity maximization of networks, Physical Review E, vol.81, issue.4, p.46102, 2010.
DOI : 10.1103/PhysRevE.81.046102
URL : https://hal.archives-ouvertes.fr/hal-00979205

. Cafieri, On convex relaxations of quadrilinear terms, Journal of Global Optimization, vol.99, issue.2, pp.661-685, 2010.
DOI : 10.1007/s10898-009-9484-1

. Liberti, The Reformulation-Optimization Software Engine, Proceedings of ICMS10, pp.303-314, 2010.
DOI : 10.1007/978-3-642-15582-6_50
URL : https://hal.archives-ouvertes.fr/hal-00979214

. Liberti, Reformulations in Mathematical Programming: A Computational Approach, Foundations of Computational Intelligence (Global Optimization: Theoretical Foundations and Applications), volume 203 of 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

. Cafieri, On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems, Computational Optimization and Applications, vol.18, issue.2, pp.27-45, 2007.
DOI : 10.1007/s10589-007-9035-y

. Cafieri, ON THE USE OF AN APPROXIMATE CONSTRAINT PRECONDITIONER IN A POTENTIAL REDUCTION ALGORITHM FOR QUADRATIC PROGRAMMING, Applied and Industrial Mathematics in Italy II, 2007.
DOI : 10.1142/9789812709394_0020

. Cafieri, Stopping criteria for inner iterations in inexact potential reduction methods: a computational study, Computational Optimization and Applications, vol.15, issue.2, pp.165-193, 2007.
DOI : 10.1007/s10589-006-9007-7

. Cafieri, Convergence Analysis of an Inexact Potential Reduction Method for Convex Quadratic Programming, Journal of Optimization Theory and Applications, vol.129, issue.1, pp.355-366, 2007.
DOI : 10.1007/s10957-007-9264-3

. Cafieri, Interior-Point Solver for Large-Scale Quadratic Programming Problems with Bound Constraints, Journal of Optimization Theory and Applications, vol.55, issue.4, pp.55-75, 2006.
DOI : 10.1007/s10957-006-9043-6

A. S. Appendix, J. Cafieri, L. Lee, and . Liberti, On convex relaxations of quadrilinear terms, Journal of Global Optimization, vol.47, pp.661-685, 2010.

S. Cafieri, P. Hansen, L. Létocart, L. Liberti, and F. Messine, Compact Relaxations for Polynomial Programming Problems, Experimental Algorithms (Proceedings of SEA 2012)
DOI : 10.1007/978-3-642-30850-5_8
URL : https://hal.archives-ouvertes.fr/hal-00938524

S. Cafieri and N. Durand, Aircraft deconfliction with speed regulation: new models from mixed-integer optimization, Optimization Online preprint n, 2012.