Pages that link to "Item:Q1002080"
From MaRDI portal
The following pages link to Block-diagonal semidefinite programming hierarchies for 0/1 programming (Q1002080):
Displaying 6 items.
- New heuristics for the vertex coloring problem based on semidefinite programming (Q351547) (← links)
- Mixed-integer nonlinear optimization: a hatchery for modern mathematics. Abstracts from the workshop held June 2--8, 2019 (Q782997) (← links)
- Symmetric sums of squares over \(k\)-subset hypercubes (Q1702778) (← links)
- \(k\)-point semidefinite programming bounds for equiangular lines (Q2149560) (← links)
- Invariant Semidefinite Programs (Q2802527) (← links)
- Partial Lasserre relaxation for sparse Max-Cut (Q6050383) (← links)
