Login / Signup

Cuts and Orderings: On Semidefinite Relaxations for the Linear Ordering Problem.

Alantha Newman
Published in: APPROX-RANDOM (2004)
Keyphrases
  • semidefinite
  • semidefinite programming
  • sufficient conditions
  • convex relaxation
  • interior point methods
  • higher dimensional
  • convex sets
  • supervised learning
  • convex optimization
  • feature selection
  • simulated annealing