Scip : solving constraint integer programs. Mathematical Programming Computation, pp.1-41, 2009. ,
A global optimization method, ?bb, for general twice-differentiable constrained nlpsii. implementation and computational results, Computers & Chemical Engineering, vol.22, issue.9, pp.1159-1179, 1998. ,
A global optimization method, ?bb, for general twice-differentiable constrained nlpsi. theoretical advances, Computers and Chemical Engineering, vol.22, issue.9, pp.1137-1158, 1998. ,
abb : A global optimization method for general con-strained nonconvex problems, Journal of Global Optimization, vol.7, pp.337-363, 1995. ,
Handbook of semidefinite, conic and polynomial optimization: Theory, algorithms, software and applications, International Series in Operational Research and Management Science, vol.166, 2012. ,
Semidefinite programming versus the reformulationlinearization technique for nonconvex quadratically constrained quadratic programming, Journal of Global Optimization, vol.43, issue.2, pp.471-484, 2009. ,
Pooling problem: Alternate formulations and solution methods, Management science, vol.50, issue.6, pp.761-776, 2004. ,
Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs, Optimization Methods Software, vol.24, issue.4-5, pp.485-504, 2009. ,
Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons, vol.129, pp.129-157, 2011. ,
Mixedinteger nonlinear optimization, Acta Numerica, vol.22, pp.1-131, 2013. ,
Branching and bounds tightening techniques for non-convex minlp, Optimization Methods and Software, issue.24, pp.597-634, 2009. ,
Optimisation discrète, De la modélisationà la résolution par des logiciels de programmation mathématique. Dunod, 2007. ,
Using a mixed integer quadratic programming solver for the unconstrained quadratic 0-1 problem, Mathematical Programming, vol.109, issue.1, pp.55-68, 2007. ,
URL : https://hal.archives-ouvertes.fr/hal-01124790
Linear reformulations of integer quadratic programs, MCO 2008, pp.43-51, 2008. ,
URL : https://hal.archives-ouvertes.fr/hal-01125562
Extending the QCR method to the case of general mixed integer program, Mathematical Programming, vol.131, issue.1, pp.381-401, 2012. ,
A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation, Journal of Combinatorial Optimization, vol.2, issue.28, pp.376-399, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01126210
Exact quadratic convex reformulations of mixed-integer quadratically constrained problems, Mathematical Programming, vol.158, issue.1, pp.235-266, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01500210
Using a conic bundle method to accelerate both phases of a quadratic convex reformulation, Informs Journal On Computing, pp.1-15, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01811329
Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method, Discrete Applied Mathematics, vol.157, issue.6, pp.1185-1197, 2009. ,
URL : https://hal.archives-ouvertes.fr/hal-01125253
Solving Mixed-Integer Quadratic Programming problems with IBM-CPLEX: a progress report, Proceedings of the Twenty-Sixth RAMP Symposium, 2014. ,
An Algorithmic Framework for Convex Mixed Integer Nonlinear Programs, Discrete Optimization, vol.5, issue.2, pp.186-204, 2008. ,
URL : https://hal.archives-ouvertes.fr/hal-00421753
Solving box-constrained nonconvex quadratic programs. optimization online, 2016. ,
, Optimization Methods and Software, vol.11, issue.1, pp.613-623, 1999.
Global optimization advances in mixed-integer nonlinear programming, minlp, and constrained derivative-free optimization, cdfo, European Journal of Operational Research, vol.252, issue.3, pp.701-727, 2016. ,
Non-convex mixed-integer nonlinear programming: a survey, Surveys in Oper. Res. and Mgmt. Sci, vol.17, issue.2, pp.97-106, 2012. ,
Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound, Comput Optim Appl, vol.43, pp.181-195, 2009. ,
Globally solving nonconvex quadratic programming problems via completely positive programming, Mathematical Programming Computation, vol.4, issue.1, pp.33-52, 2012. ,
Benchmarking optimization software with performance profiles, Mathematical Programming, vol.91, pp.201-213, 1986. ,
Constraint propagation on quadratic constraints, Constraints, vol.15, issue.3, pp.404-429, 2010. ,
A mixed-integer nonlinear programming algorithm for process systems synthesis, AIChE J, vol.32, issue.4, pp.592-606, 1986. ,
An outer-approximation algorithm for a class of mixed-integer nonlinear programs, Mathematical Programming, vol.36, pp.307-339, 1986. ,
An algorithm for separable nonconvex programming problems, Management Science, vol.15, pp.550-560, 1969. ,
A review of recent advances in global optimization, Journal of Global Optimization, vol.45, issue.1, pp.3-38, 2009. ,
A global optimization algorithm (gop) for certain classes of nonconvex nlpsi. theory. Computers & chemical engineering, vol.14, pp.1397-1417, 1990. ,
Primal-relaxed dual global optimization approach, Journal of Optimization Theory and Applications, vol.78, issue.2, pp.187-225, 1993. ,
L'algèbre de Boole et ses Applications en Recherche Opérationnelle. Cahiers du Centre d, Etudes de Recherche Opérationnelle, vol.4, pp.5-36, 1959. ,
Computers and Intractability: A guide to the theory of NP-Completness, 1979. ,
Continuous quadratic programming formulations of optimization problems on graphs, European Journal of Operational Research, vol.240, issue.2, pp.328-337, 2015. ,
Some remarks on quadratic programming with 0-1 variables. Revue Française d'Informatique et de Recherche Opérationnelle, vol.4, pp.67-79, 1970. ,
Studies of the behaviour of recursion for the pooling problem, ACM SIGMAP Bulletin, vol.26, 1978. ,
, Conic Bundle, 2011.
IBM ILOG CPLEX 12.6.2 Reference Manual, 2015. ,
IQCP/MIQCP: Library of Integer and Mixed-Integer Quadratic Quadratically Constrained Programs, 2013. ,
Computationally efficient MIP formulation and algorithms for european day-ahead electricity market auctions, European Journal of Operational Research, vol.242, issue.2, pp.580-593, 2015. ,
Computability of global solutions to factorable non-convex programs: Part i -convex underestimating problems, Mathematical Programming, vol.10, issue.1, pp.147-175, 1976. ,
Global optimization of mixed-integer quadraticallyconstrained quadratic programs (MIQCQP) through piecewise-linear and edgeconcave relaxations, Math. Program. B, vol.136, issue.1, pp.155-182, 2012. ,
GloMIQO: Global mixed-integer quadratic optimizer, Journal of Global Optimization, vol.57, issue.1, pp.3-50, 2013. ,
Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2. Optimization Methods and Software, vol.30, pp.215-249, 2015. ,
Algorithms for bound constrained quadratic programming problems, Numerische Mathematik, vol.55, issue.4, pp.377-400, 1989. ,
Algorithms and software for convex mixed integer nonlinear programs, Mixed integer nonlinear programming, pp.1-39, 2012. ,
Baron 9.0.4: Global optimization of mixedinteger nonlinear programs. User's Manual, 2010. ,
Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations, Mathematical Programming, vol.130, pp.359-413, 2011. ,
A hierarchy of relaxation between the continuous and convex hull representations for zero-one programming problems, SIAM Journal Discrete Mathematics, vol.3, pp.411-430, 1990. ,
Global optimization of mixed-integer nonlinear programs: A theoretical and computational study, Mathematical programming, vol.99, issue.3, pp.563-591, 2004. ,
Convexification and global optimization in continuous and mixed-integer nonlinear programming, 2002. ,
A polyhedral branch-and-cut approach to global optimization, Mathematical Programming, vol.103, issue.2, pp.225-249, 2005. ,
A branch-and-cut algorithm for nonconvex quadratic programs with box constraints, Mathematical Programming, vol.102, issue.3, pp.259-275, 2005. ,
Scip: Global optimization of mixed-integer nonlinear programs in a branch-and-cut framework. optimization online, 2016. ,
New properties and computational improvement of the gop algorithm for problems with quadratic objective functions and constraints, Journal of Global Optimization, vol.3, issue.4, pp.439-462, 1993. ,
A global optimization algorithm (gop) for certain classes of nonconvex nlpsii. application of theory and test problems, Computers & chemical engineering, vol.14, issue.12, pp.1419-1434, 1990. ,
Computational experience with applications of bilinear cutting planes, Industrial & Engineering Chemistry Research, vol.52, issue.22, pp.7514-7525, 2013. ,
Global optimization of general non-convex problems with intermediate bilinear substructures, Optimization Methods and Software, vol.29, issue.3, pp.442-462, 2014. ,