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 50 items.
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems (Q296969) (← links)
- Copositive optimization -- recent developments and applications (Q421783) (← links)
- Spectral bounds for the independence ratio and the chromatic number of an operator (Q466129) (← links)
- A polynomial time constraint-reduced algorithm for semidefinite optimization problems (Q493064) (← links)
- On metric properties of maps between Hamming spaces and related graph homomorphisms (Q507807) (← links)
- A new property of the Lovász number and duality relations between graph parameters (Q516767) (← links)
- An axiomatic duality framework for the theta body and related convex corners (Q517307) (← 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 bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (Q896848) (← 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)
- Symmetry in Turán sums of squares polynomials from flag algebras (Q1637376) (← links)
- Sabidussi versus Hedetniemi for three variations of the chromatic number (Q1677539) (← links)
- A semidefinite programming approach to a cross-intersection problem with measures (Q1683683) (← links)
- Optimization over structured subsets of positive semidefinite matrices via column generation (Q1751222) (← links)
- On the Lovász theta function and some variants (Q1751239) (← 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)
- On semidefinite programming relaxations of maximum \(k\)-section (Q1925786) (← links)
- Complete positivity and distance-avoiding sets (Q2118086) (← links)
- Algebras, graphs and thetas (Q2132354) (← links)
- On standard quadratic programs with exact and inexact doubly nonnegative relaxations (Q2133420) (← links)
- Dimension reduction for semidefinite programs via Jordan algebras (Q2188241) (← links)
- Vector coloring the categorical product of graphs (Q2191770) (← links)
- Improving ADMMs for solving doubly nonnegative programs through dual factorization (Q2240675) (← links)
- Applications of Ramsey theory (Q2266026) (← links)
- Bounds on permutation codes of distance four (Q2269535) (← links)
- Semidefinite programming bounds for Lee codes (Q2312798) (← links)
- On upper bounding Shannon capacity of graph through generalized conic programming (Q2329653) (← links)
- Completely positive reformulations for polynomial optimization (Q2349130) (← links)
- A semidefinite programming hierarchy for packing problems in discrete geometry (Q2349135) (← links)
- Exploiting symmetry in copositive programs via semidefinite hierarchies (Q2349140) (← links)