Pages that link to "Item:Q868457"
From MaRDI portal
The following pages link to Semidefinite programming relaxations for graph coloring and maximal clique problems (Q868457):
Displayed 5 items.
- A boundary point method to solve semidefinite programs (Q858180) (← links)
- Simple ingredients leading to very efficient heuristics for the maximum clique problem (Q1009196) (← links)
- A simple simulated annealing algorithm for the maximum clique problem (Q2456476) (← links)
- A semidefinite programming-based heuristic for graph coloring (Q2467349) (← links)
- Binary Positive Semidefinite Matrices and Associated Integer Polytopes (Q3503844) (← links)