Pages that link to "Item:Q3596364"
From MaRDI portal
The following pages link to Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials (Q3596364):
Displaying 12 items.
- Handelman's hierarchy for the maximum stable set problem (Q480821) (← links)
- Copositive programming motivated bounds on the stability and the chromatic numbers (Q847835) (← links)
- Semidefinite programming relaxations for graph coloring and maximal clique problems (Q868457) (← links)
- Semidefinite bounds for the stability number of a graph via sums of squares of polynomials (Q877197) (← links)
- Exploiting equalities in polynomial programming (Q935230) (← links)
- Simple ingredients leading to very efficient heuristics for the maximum clique problem (Q1009196) (← links)
- An SDP-based approach for computing the stability number of a graph (Q2123126) (← links)
- Completely positive reformulations for polynomial optimization (Q2349130) (← links)
- Some advances on Lovász-Schrijver semidefinite programming relaxations of the fractional stable set polytope (Q2448881) (← links)
- Copositivity cuts for improving SDP bounds on the clique number (Q2638373) (← links)
- Copositive Programming (Q2802526) (← links)
- Bounds on the Stability Number of a Graph via the Inverse Theta Function (Q2973236) (← links)
