Pages that link to "Item:Q1892101"
From MaRDI portal
The following pages link to The expected relative error of the polyhedral approximation of the max- cut problem (Q1892101):
Displaying 10 items.
- Small bipartite subgraph polytopes (Q613319) (← links)
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes (Q1290621) (← links)
- Node and edge relaxations of the max-cut problem (Q1319044) (← links)
- Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems (Q1751224) (← links)
- One-third-integrality in the max-cut problem (Q1924057) (← links)
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem (Q2506169) (← links)
- A guide to conic optimisation and its applications (Q4634309) (← links)
- Sherali-adams strikes back (Q5091758) (← links)
- (Q5158503) (← links)
- A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems (Q6160119) (← links)
