1. Versus copositive bounds for standard QP;Anstreicher;Journal of Global Optimization,2005
2. Solving standard quadratic optimization problems via linear, semidefinite and copositive programming;Bomze;Journal of Global Optimization,2002
3. Subdivision, sampling and initialization strategies for simplicial branch and bound in global optimization;Claussen;Computers and Mathematics with Applications,2002
4. Global Optimization at Work;Hendrix,1998
5. Hendrix, E.M.T., Casado, L.G., García, I., 2006. Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints. Technical Report 30, Mansholt Graduate School, http://www.sls.wau.nl/mi/mgs/publications.