Login / Signup

A branch-and-cut method for 0-1 mixed convex programming.

Robert A. StubbsSanjay Mehrotra
Published in: Math. Program. (1999)
Keyphrases
  • similarity measure
  • objective function
  • clustering method
  • interior point methods
  • convex programming
  • least squares
  • linear programming
  • model selection
  • probability density function
  • convergence rate