Pages that link to "Item:Q1373736"

The following pages link to Connection between semidefinite relaxations of the max-cut and stable set problems (Q1373736):

Displaying 17 items.

• An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem (Q623464) (← links)
• The real positive semidefinite completion problem for series-parallel graphs (Q676039) (← links)
• The equivalence of semidefinite relaxations of polynomial 0-1 and \(\pm 1\) programs via scaling (Q943789) (← links)
• Solving quadratic (0,1)-problems by semidefinite programs and cutting planes (Q1290621) (← links)
• Semidefinite programming in combinatorial optimization (Q1365053) (← links)
• Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem (Q1602704) (← links)
• SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances (Q1925791) (← links)
• An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem (Q2390997) (← links)
• Exploiting semidefinite relaxations in constraint programming (Q2489123) (← links)
• Exploring the relationship between max-cut and stable set relaxations (Q2490329) (← links)
• Asymptotic Bayesian structure learning using graph supports for Gaussian graphical models (Q2507765) (← links)
• Semidefinite Programming and Constraint Programming (Q2802541) (← links)
• A Derivation of Lovász' Theta via Augmented Lagrange Duality (Q4809664) (← links)
• Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
• Combining semidefinite and polyhedral relaxations for integer programs (Q5101410) (← links)
• Semidefinite programming and combinatorial optimization (Q5906394) (← links)
• On Integrality in Semidefinite Programming for Discrete Optimization (Q6130544) (← links)