Pages that link to "Item:Q279802"
From MaRDI portal
The following pages link to Cutting planes for semidefinite relaxations based on triangle-free subgraphs (Q279802):
Displaying 9 items.
- Burer's key assumption for semidefinite and doubly nonnegative relaxations (Q691396) (← links)
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs (Q977327) (← links)
- Binary quadratic optimization problems that are difficult to solve by conic relaxations (Q1751225) (← links)
- On a positive semidefinite relaxation of the cut polytope (Q1894508) (← links)
- Separating doubly nonnegative and completely positive matrices (Q1942269) (← links)
- Separation and relaxation for cones of quadratic forms (Q1942279) (← links)
- Triangle-free graphs and completely positive matrices (Q2155141) (← links)
- Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures (Q2182857) (← links)
- (Q4400647) (← links)