Login / Signup

A branch and cut algorithm for nonconvex quadratically constrained quadratic programming.

Charles AudetPierre HansenBrigitte JaumardGilles Savard
Published in: Math. Program. (2000)
Keyphrases
  • np hard
  • learning algorithm
  • k means
  • objective function
  • computational complexity
  • pairwise
  • linear programming
  • distance function
  • spectral clustering
  • convex optimization