Pages that link to "Item:Q3888960"
From MaRDI portal
The following pages link to A comparison of the Delsarte and Lovász bounds (Q3888960):
Displayed 36 items.
- Copositive optimization -- recent developments and applications (Q421783) (← links)
- Quadratic factorization heuristics for copositive programming (Q542052) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming (Q717133) (← links)
- Copositive programming motivated bounds on the stability and the chromatic numbers (Q847835) (← links)
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem (Q847851) (← links)
- Semidefinite programming relaxations for graph coloring and maximal clique problems (Q868457) (← links)
- Strengthened semidefinite programming bounds for codes (Q868466) (← links)
- A characterization of Delsarte's linear programming bound as a ratio bound (Q876308) (← links)
- Semidefinite bounds for the stability number of a graph via sums of squares of polynomials (Q877197) (← links)
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability (Q930342) (← links)
- Simple ingredients leading to very efficient heuristics for the maximum clique problem (Q1009196) (← links)
- On the Lovász \(\vartheta\)-number of almost regular graphs with application to Erdős-Rényi graphs (Q1024280) (← links)
- Commutative association schemes (Q1039424) (← links)
- Exploiting group symmetry in truss topology optimization (Q1041375) (← links)
- Exploiting special structure in semidefinite programming: a survey of theory and applications (Q1044129) (← links)
- Lower bounds for measurable chromatic numbers (Q1047119) (← links)
- Role of redundant constraints for improving dual bounds in polynomial optimization problems (Q1288665) (← links)
- Capacities: From information theory to extremal set theory (Q1337171) (← links)
- Semidefinite programming in combinatorial optimization (Q1365053) (← links)
- Spectral characterizations of the Lovász number and the Delsarte number of a graph (Q1592957) (← links)
- Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring (Q1774164) (← links)
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming (Q1905964) (← links)
- On product of association schemes and Shannon capacity (Q1916139) (← links)
- Applications of Ramsey theory (Q2266026) (← links)
- Bounds on permutation codes of distance four (Q2269535) (← links)
- An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem (Q2390997) (← links)
- Exploring the relationship between max-cut and stable set relaxations (Q2490329) (← links)
- Orthogonal representations over finite fields and the chromatic number of graphs (Q2563517) (← links)
- D.C. versus copositive bounds for standard QP (Q2583183) (← links)
- Copositivity cuts for improving SDP bounds on the clique number (Q2638373) (← links)
- A note on the stability number of an orthogonality graph (Q2643845) (← links)
- Matrix Relaxations in Combinatorial Optimization (Q2897308) (← links)
- A New Approach to the Stable Set Problem Based on Ellipsoids (Q3009765) (← links)
- Reduction of truss topology optimization (Q3052591) (← links)
- Gap, cosum and product properties of the θ′ bound on the clique number (Q3066919) (← links)