Convex relaxations of (0, 1)-quadratric programming

A Barrier Function Method for the Nonconvex Quadratic Programming Problem with Box Constraints

Journal of Global Optimization

Semidefinite programming for discrete optimization and matrix completion problems

Discrete Applied Mathematics

Best ellipsoidal relaxation to solve a nonconvex problem

Journal of Computational and Applied Mathematics - Special issue: Proceedings of the international conference on linear algebra and arithmetic, Rabat, Morocco, 28-31 May 2001

A global continuation algorithm for solving binary quadratic programming problems

Computational Optimization and Applications

Review: Using the eigenvalue relaxation for binary least-squares estimation problems

Signal Processing

Duality Gap Estimation of Linear Equality Constrained Binary Quadratic Programming

Mathematics of Operations Research

Nonconvex quadratically constrained quadratic programming: best D.C. decompositions and their SDP representations

Journal of Global Optimization

On duality gap in binary quadratic programming

Journal of Global Optimization

Particle Algorithms for Optimization on Binary Spaces

ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special Issue on Monte Carlo Methods in Statistics