Pages that link to "Item:Q2638373"
From MaRDI portal
The following pages link to Copositivity cuts for improving SDP bounds on the clique number (Q2638373):
Displaying 11 items.
- Cutting planes for semidefinite relaxations based on triangle-free subgraphs (Q279802) (← 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)
- Separating doubly nonnegative and completely positive matrices (Q1942269) (← links)
- Exploiting symmetry in copositive programs via semidefinite hierarchies (Q2349140) (← links)
- Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem (Q2391873) (← links)
- Factorization and cutting planes for completely positive matrices by copositive projection (Q2436642) (← links)
- Strengthening Chvátal-Gomory Cuts for the Stable Set Problem (Q2835677) (← links)
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques (Q5139846) (← links)
- (Global) optimization: historical notes and recent developments (Q6114910) (← links)
- Approximation of the Shannon capacity via matrix cone programming (Q6151010) (← links)
