A recipe for semidefinite relaxation for (0,1)-quadratic programming

This publication has 15 references indexed in Scilit:

• On the equivalence between roof duality and Lagrangian duality for unconstrained 0–1 quadratic programming problems
  Discrete Applied Mathematics, 1994
• A lift-and-project cutting plane algorithm for mixed 0–1 programs
  Mathematical Programming, 1993
• Remarks on a difficult test problem for quadratic boolean programming
  Optimization, 1992
• Cones of Matrices and Set-Functions and 0–1 Optimization
  SIAM Journal on Optimization, 1991
• A tight bound for the boolean quadratic optimization problem and its use in a branch and bound algorithm¹
  Optimization, 1988
• Computing a Trust Region Step
  SIAM Journal on Scientific and Statistical Computing, 1983
• Some applications of optimization in matrix theory
  Linear Algebra and its Applications, 1981
• A comparison of the Delsarte and Lovász bounds
  IEEE Transactions on Information Theory, 1979
• On Some Problems of Lovász Concerning the Shannon Capacity of a Graph
  IEEE Transactions on Information Theory, 1979
• On the Shannon capacity of a graph
  IEEE Transactions on Information Theory, 1979