Pages that link to "Item:Q1774164"
From MaRDI portal
The following pages link to Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring (Q1774164):
Displaying 9 items.
- Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank (Q304255) (← 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)
- Chromatic Gallai identities operating on Lovász number (Q2452384) (← links)
- A semidefinite programming-based heuristic for graph coloring (Q2467349) (← links)
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition (Q2583135) (← links)
- The sandwich line graph (Q2861516) (← links)
- (Q3984938) (← links)
- On Integrality in Semidefinite Programming for Discrete Optimization (Q6130544) (← links)