Related references
Note: Only part of the references are listed.Global optimization problems and domain reduction strategies
Alberto Caprara et al.
MATHEMATICAL PROGRAMMING (2010)
Branching and bounds tightening techniques for non-convex MINLP
Pietro Belotti et al.
OPTIMIZATION METHODS & SOFTWARE (2009)
An exact reformulation algorithm for large nonconvex NLPs involving bilinear terms
Leo Liberti et al.
JOURNAL OF GLOBAL OPTIMIZATION (2006)
Linearity embedded in nonconvex programs
L Liberti
JOURNAL OF GLOBAL OPTIMIZATION (2005)
A polyhedral branch-and-cut approach to global optimization
M Tawarmalani et al.
MATHEMATICAL PROGRAMMING (2005)
SNOPT: An SQP algorithm for large-scale constrained optimization (Reprinted from SIAM Journal Optimization, vol 12, pg 979-1006, 2002)
PE Gill et al.
SIAM REVIEW (2005)
Enhancing RLT relaxations via a new class of semidefinite cuts
HD Sherali et al.
JOURNAL OF GLOBAL OPTIMIZATION (2002)
Reduced first-level representations via the reformulation-linearization technique: results, counterexamples, and computations
HD Sherali et al.
DISCRETE APPLIED MATHEMATICS (2000)