Computational Experience with Stable Set Relaxations
From MaRDI portal
Publication:4441935
DOI10.1137/S1052623401394092zbMath1049.90075OpenAlexW2000920559MaRDI QIDQ4441935
Publication date: 19 January 2004
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623401394092
Semidefinite programming (90C22) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items
Mathematical Programming Models and Exact Algorithms, A heuristic for the stability number of a graph based on convex quadratic programming and tabu search, An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem, Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem, Semidefinite programming relaxations for graph coloring and maximal clique problems, Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming, The stable set problem: clique and nodal inequalities revisited, Strong lift-and-project cutting planes for the stable set problem, Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms, Strong SDP based bounds on the cutwidth of a graph, A branch and cut solver for the maximum stable set problem, A New Approach to the Stable Set Problem Based on Ellipsoids, On the Lovász theta function and some variants, A new lift-and-project operator, Exploiting semidefinite relaxations in constraint programming, Exploring the relationship between max-cut and stable set relaxations, Indirect unstructured hex-dominant mesh generation using tetrahedra recombination, On extracting maximum stable sets in perfect graphs using Lovász's theta function, Semidefinite Programming and Constraint Programming, Strengthening Chvátal-Gomory Cuts for the Stable Set Problem
