Pages that link to "Item:Q847835"

The following pages link to Copositive programming motivated bounds on the stability and the chromatic numbers (Q847835):

Displaying 19 items.

• Conic formulations of graph homomorphisms (Q295829) (← 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)
• An axiomatic duality framework for the theta body and related convex corners (Q517307) (← links)
• Quadratic factorization heuristics for copositive programming (Q542052) (← links)
• Semidefinite programming relaxations for graph coloring and maximal clique problems (Q868457) (← links)
• Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization (Q1704915) (← links)
• Algebras, graphs and thetas (Q2132354) (← links)
• A semidefinite relaxation algorithm for checking completely positive separable matrices (Q2313773) (← links)
• On upper bounding Shannon capacity of graph through generalized conic programming (Q2329653) (← links)
• Completely positive reformulations for polynomial optimization (Q2349130) (← 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)
• The CP-Matrix Approximation Problem (Q2790067) (← links)
• Copositive Programming (Q2802526) (← links)
• Matrix Relaxations in Combinatorial Optimization (Q2897308) (← links)
• SOME EXPERIENCES WITH SOLVING SEMIDEFINITE PROGRAMMING RELAXATIONS OF BINARY QUADRATIC OPTIMIZATION MODELS IN COMPUTATIONAL BIOLOGY (Q2931718) (← links)
• Depth-first simplicial partition for copositivity detection, with an application to MaxClique (Q3093056) (← links)
• Graph isomorphism: physical resources, optimization models, and algebraic characterizations (Q6126661) (← links)