Related references
Note: Only part of the references are listed.THE CONVEX HULL OF A QUADRATIC CONSTRAINT OVER A POLYTOPE
Asteroide Santana et al.
SIAM JOURNAL ON OPTIMIZATION (2020)
New SOCP relaxation and branching rule for bipartite bilinear programs
Santanu S. Dey et al.
OPTIMIZATION AND ENGINEERING (2019)
Deriving convex hulls through lifting and projection
Trang T. Nguyen et al.
MATHEMATICAL PROGRAMMING (2018)
On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation
Emily Speakman et al.
JOURNAL OF GLOBAL OPTIMIZATION (2018)
Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations
Jon Lee et al.
MATHEMATICAL PROGRAMMING (2018)
Strong formulations for the pooling problem
Mohammed Alfaki et al.
JOURNAL OF GLOBAL OPTIMIZATION (2013)
Computable representations for convex hulls of low-dimensional quadratic forms
Kurt M. Anstreicher et al.
MATHEMATICAL PROGRAMMING (2010)
Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
Kurt M. Anstreicher
JOURNAL OF GLOBAL OPTIMIZATION (2009)
Branching and bounds tightening techniques for non-convex MINLP
Pietro Belotti et al.
OPTIMIZATION METHODS & SOFTWARE (2009)
THE CONVEX ENVELOPE OF (N-1)-CONVEX FUNCTIONS
Matthias Jach et al.
SIAM JOURNAL ON OPTIMIZATION (2008)
A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
J Linderoth
MATHEMATICAL PROGRAMMING (2005)
Share Paper
