Pages that link to "Item:Q3596364"

The following pages link to Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials (Q3596364):

Displaying 7 items.

• 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)
• Exploiting equalities in polynomial programming (Q935230) (← links)
• Simple ingredients leading to very efficient heuristics for the maximum clique problem (Q1009196) (← links)
• Completely positive reformulations for polynomial optimization (Q2349130) (← links)
• Copositivity cuts for improving SDP bounds on the clique number (Q2638373) (← links)
• Copositive Programming (Q2802526) (← links)