Pages that link to "Item:Q4441935"

The following pages link to Computational Experience with Stable Set Relaxations (Q4441935):

Displaying 21 items.

• Strong lift-and-project cutting planes for the stable set problem (Q378110) (← links)
• A branch and cut solver for the maximum stable set problem (Q491210) (← links)
• Indirect unstructured hex-dominant mesh generation using tetrahedra recombination (Q722824) (← links)
• A heuristic for the stability number of a graph based on convex quadratic programming and tabu search (Q844531) (← links)
• Semidefinite programming relaxations for graph coloring and maximal clique problems (Q868457) (← links)
• On the Lovász theta function and some variants (Q1751239) (← links)
• A new lift-and-project operator (Q1752818) (← links)
• An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem (Q2390997) (← links)
• Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem (Q2391873) (← links)
• Exploiting semidefinite relaxations in constraint programming (Q2489123) (← links)
• Exploring the relationship between max-cut and stable set relaxations (Q2490329) (← links)
• On extracting maximum stable sets in perfect graphs using Lovász's theta function (Q2506178) (← links)
• The stable set problem: clique and nodal inequalities revisited (Q2664356) (← links)
• Semidefinite Programming and Constraint Programming (Q2802541) (← links)
• Strengthening Chvátal-Gomory Cuts for the Stable Set Problem (Q2835677) (← links)
• Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms (Q2949518) (← links)
• A New Approach to the Stable Set Problem Based on Ellipsoids (Q3009765) (← links)
• Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
• Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming (Q5086003) (← links)
• Strong SDP based bounds on the cutwidth of a graph (Q6065655) (← links)
• On different versions of the exact subgraph hierarchy for the stable set problem (Q6585245) (← links)