Pages that link to "Item:Q2768060"

The following pages link to Strengthened semidefinite programming relaxations for the max-cut problem. (Q2768060):

Displaying 16 items.

• Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837) (← links)
• Connection between semidefinite relaxations of the max-cut and stable set problems (Q1373736) (← links)
• Stronger linear programming relaxations of max-cut (Q1403298) (← links)
• A tight semidefinite relaxation of the MAX CUT problem (Q1417849) (← 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)
• On semidefinite programming relaxations of maximum \(k\)-section (Q1925786) (← links)
• A novel formulation of the max-cut problem and related algorithm (Q2287710) (← links)
• Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints (Q2287849) (← links)
• Improved semidefinite bounding procedure for solving max-cut problems to optimality (Q2436651) (← links)
• Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition (Q2583135) (← links)
• Tighter linear and semidefinite relaxations for max-cut based on the Lovász-Schrijver lift-and-project procedure (Q2784415) (← links)
• A NEW SECOND-ORDER CONE PROGRAMMING RELAXATION FOR MAX-CUT PROBLEMS (Q4446320) (← links)
• On the integrality gap of the maximum-cut semidefinite programming relaxation in fixed dimension (Q5126773) (← links)
• (Q5425124) (← links)
• Solving SDP relaxations of max-cut problem with large number of hypermetric inequalities by L-BFGS-B (Q6155645) (← links)