scientific article
From MaRDI portal
Publication:2760093
zbMath0983.90047MaRDI QIDQ2760093
Publication date: 18 December 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
approximate solutionsheuristicmaximum cliquesemidefinite programsmaximum stable setpositive semidefinite relaxationdual scaling algorithmminimum graph coloring
Programming involving graphs or networks (90C35) Semidefinite programming (90C22) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Semidefinite programming relaxations for graph coloring and maximal clique problems, Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques, A semidefinite programming-based heuristic for graph coloring, On extracting maximum stable sets in perfect graphs using Lovász's theta function, On the Slater condition for the SDP relaxations of nonconvex sets