Pages that link to "Item:Q3629507"
From MaRDI portal
The following pages link to The Operator $\Psi$ for the Chromatic Number of a Graph (Q3629507):
Displaying 30 items.
- Dynamic coloring of graphs having no \(K_5\) minor (Q277625) (← links)
- Copositivity and constrained fractional quadratic problems (Q403649) (← links)
- Copositive optimization -- recent developments and applications (Q421783) (← links)
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization (Q427378) (← links)
- On the computational complexity of membership problems for the completely positive cone and its dual (Q461444) (← links)
- An axiomatic duality framework for the theta body and related convex corners (Q517307) (← links)
- Copositive programming motivated bounds on the stability and the chromatic numbers (Q847835) (← links)
- Block-diagonal semidefinite programming hierarchies for 0/1 programming (Q1002080) (← links)
- Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization (Q1650765) (← links)
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 (Q1731962) (← links)
- A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs (Q1752600) (← links)
- Semidefinite and linear programming integrality gaps for scheduling identical machines (Q1800998) (← links)
- Algebras, graphs and thetas (Q2132354) (← links)
- Completely positive reformulations for polynomial optimization (Q2349130) (← links)
- Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme (Q2355798) (← links)
- Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem (Q2391873) (← links)
- Convex Relaxations and Integrality Gaps (Q2802523) (← links)
- Copositive Programming (Q2802526) (← links)
- Invariant Semidefinite Programs (Q2802527) (← links)
- Matrix Relaxations in Combinatorial Optimization (Q2897308) (← links)
- Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines (Q3186499) (← links)
- Spotting Trees with Few Leaves (Q3448789) (← links)
- Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone (Q3457190) (← links)
- Dual Hoffman Bounds for the Stability and Chromatic Numbers Based on Semidefinite Programming (Q5013579) (← links)
- On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs (Q5081783) (← links)
- The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems (Q5084675) (← links)
- Collective dynamics of phase-repulsive oscillators solves graph coloring problem (Q5112986) (← links)
- Spotting Trees with Few Leaves (Q5346548) (← links)
- Colorings of complements of line graphs (Q6056781) (← links)
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems (Q6114924) (← links)
