Pages that link to "Item:Q1894508"
From MaRDI portal
The following pages link to On a positive semidefinite relaxation of the cut polytope (Q1894508):
Displaying 50 items.
- Cutting planes for semidefinite relaxations based on triangle-free subgraphs (Q279802) (← links)
- Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without \(K_{5}\) minors (Q314769) (← links)
- Gap inequalities for non-convex mixed-integer quadratic programs (Q408381) (← links)
- A class of hypergraphs and vertices of cut polytope relaxations (Q416923) (← links)
- Strengthening lattice-free cuts using non-negativity (Q429683) (← links)
- A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs (Q431017) (← links)
- Complexity results for the gap inequalities for the max-cut problem (Q439900) (← links)
- Binary positive semidefinite matrices and associated integer polytopes (Q662294) (← links)
- The real positive semidefinite completion problem for series-parallel graphs (Q676039) (← links)
- On verified numerical computations in convex programming (Q849186) (← links)
- Efficient rank reduction of correlation matrices (Q875015) (← links)
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes (Q1290621) (← links)
- Cuts, matrix completions and graph rigidity (Q1365058) (← links)
- A connection between positive semidefinite and Euclidean distance matrix completion problems (Q1381268) (← links)
- Null spaces of correlation matrices (Q1399237) (← links)
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem (Q1602704) (← links)
- Geometry of semidefinite Max-Cut relaxations via matrix ranks (Q1610658) (← links)
- Cut polytope has vertices on a line (Q1739929) (← links)
- One-third-integrality in the max-cut problem (Q1924057) (← links)
- Simplicial faces of the set of correlation matrices (Q1991097) (← links)
- Intersection bodies of polytopes (Q2143391) (← links)
- On attainability of Kendall's tau matrices and concordance signatures (Q2146469) (← links)
- On computational capabilities of Ising machines based on nonlinear oscillators (Q2150420) (← links)
- Parametrising correlation matrices (Q2181727) (← links)
- Theorems of the alternative for conic integer programming (Q2183216) (← links)
- The geometry of SDP-exactness in quadratic optimization (Q2191775) (← links)
- Valid inequalities for quadratic optimisation with domain constraints (Q2234747) (← links)
- Three-by-three correlation matrices: its exact shape and a family of distributions (Q2250952) (← links)
- Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting (Q2307758) (← links)
- Determinantal sampling designs (Q2317241) (← links)
- Admissible Bernoulli correlations (Q2325265) (← links)
- A new separation algorithm for the Boolean quadric and cut polytopes (Q2339832) (← links)
- On the separation of split inequalities for non-convex quadratic integer programming (Q2339844) (← links)
- A note on the 2-circulant inequalities for the MAX-cut problem (Q2417185) (← links)
- Exploring the relationship between max-cut and stable set relaxations (Q2490329) (← links)
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem (Q2506169) (← links)
- Asymptotic Bayesian structure learning using graph supports for Gaussian graphical models (Q2507765) (← links)
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations (Q2638381) (← links)
- Generalised 2-circulant inequalities for the max-cut problem (Q2670485) (← links)
- Trigonometric approximation of the max-cut polytope is star-like (Q2673542) (← links)
- On distance scales, embeddings, and efficient relaxations of the cut cone (Q2921657) (← links)
- Application of semi definite relaxation and variable neighborhood search for multiuser detection in synchronous CDMA (Q3057146) (← links)
- Binary Positive Semidefinite Matrices and Associated Integer Polytopes (Q3503844) (← links)
- Some Recent Developments in Spectrahedral Computation (Q4556598) (← links)
- Symbolic computation in hyperbolic programming (Q4561483) (← links)
- A Lower Bound on the Positive Semidefinite Rank of Convex Bodies (Q4564016) (← links)
- A guide to conic optimisation and its applications (Q4634309) (← links)
- (Q4636985) (← links)
- Cone-LP's and semidefinite programs: Geometry and a simplex-type method (Q4645921) (← links)
- (Q4737533) (← links)
