Pages that link to "Item:Q868457"

The following pages link to Semidefinite programming relaxations for graph coloring and maximal clique problems (Q868457):

Displaying 31 items.

• Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank (Q304255) (← links)
• New heuristics for the vertex coloring problem based on semidefinite programming (Q351547) (← links)
• 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)
• Binary positive semidefinite matrices and associated integer polytopes (Q662294) (← links)
• Copositive programming motivated bounds on the stability and the chromatic numbers (Q847835) (← links)
• A boundary point method to solve semidefinite programs (Q858180) (← links)
• Simple ingredients leading to very efficient heuristics for the maximum clique problem (Q1009196) (← links)
• On the Lovász theta function and some variants (Q1751239) (← links)
• General cut-generating procedures for the stable set polytope (Q1752480) (← links)
• A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs (Q1752600) (← links)
• A new lift-and-project operator (Q1752818) (← links)
• Matrix optimization over low-rank spectral sets: stationary points and local and global minimizers (Q2302834) (← 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)
• Chromatic Gallai identities operating on Lovász number (Q2452384) (← links)
• A simple simulated annealing algorithm for the maximum clique problem (Q2456476) (← links)
• A semidefinite programming-based heuristic for graph coloring (Q2467349) (← links)
• Copositivity cuts for improving SDP bounds on the clique number (Q2638373) (← links)
• The stable set problem: clique and nodal inequalities revisited (Q2664356) (← links)
• Calmness of partial perturbation to composite rank constraint systems and its applications (Q2694518) (← links)
• Projection Methods in Conic Optimization (Q2802538) (← links)
• Strengthening Chvátal-Gomory Cuts for the Stable Set Problem (Q2835677) (← links)
• (Q2861516) (← 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)
• Gap, cosum and product properties of the θ′ bound on the clique number (Q3066919) (← links)
• Binary Positive Semidefinite Matrices and Associated Integer Polytopes (Q3503844) (← links)
• A tutorial on branch and cut algorithms for the maximum stable set problem (Q4918254) (← 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)
• On Integrality in Semidefinite Programming for Discrete Optimization (Q6130544) (← links)