The following pages link to (Q4194987):
Displaying 30 items.
- Copositive optimization -- recent developments and applications (Q421783) (← links)
- Spectral bounds for the independence ratio and the chromatic number of an operator (Q466129) (← 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)
- Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming (Q717133) (← 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)
- Lower bounds for measurable chromatic numbers (Q1047119) (← links)
- On the Shannon capacity of a directed graph (Q1074597) (← links)
- Capacities: From information theory to extremal set theory (Q1337171) (← links)
- Spectral characterizations of the Lovász number and the Delsarte number of a graph (Q1592957) (← links)
- Sabidussi versus Hedetniemi for three variations of the chromatic number (Q1677539) (← links)
- Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring (Q1774164) (← links)
- On product of association schemes and Shannon capacity (Q1916139) (← links)
- Complete positivity and distance-avoiding sets (Q2118086) (← links)
- Improving upper bounds for the clique number by non-valid inequalities (Q2340341) (← links)
- Tightening a copositive relaxation for standard quadratic optimization problems (Q2376121) (← links)
- Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem (Q2391873) (← links)
- Graph homomorphisms via vector colorings (Q2422244) (← links)
- Chromatic Gallai identities operating on Lovász number (Q2452384) (← links)
- Copositivity cuts for improving SDP bounds on the clique number (Q2638373) (← links)
- A characterization of the weighted version of McEliece–Rodemich–Rumsey–Schrijver number based on convex quadratic programming (Q2788727) (← links)
- Relaxations of Combinatorial Problems Via Association Schemes (Q2802525) (← links)
- Invariant Semidefinite Programs (Q2802527) (← links)
- Matrix Relaxations in Combinatorial Optimization (Q2897308) (← links)
- A recursive Lovász theta number for simplex-avoiding sets (Q5097318) (← links)
- A Sum of Squares Characterization of Perfect Graphs (Q6087752) (← links)
