Pages that link to "Item:Q1417849"

The following pages link to A tight semidefinite relaxation of the MAX CUT problem (Q1417849):

Displaying 19 items.

• Canonical dual approach to solving the maximum cut problem (Q693126) (← links)
• Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837) (← links)
• The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds (Q1179735) (← links)
• Node and edge relaxations of the max-cut problem (Q1319044) (← links)
• Connection between semidefinite relaxations of the max-cut and stable set problems (Q1373736) (← 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)
• A discrete dynamic convexized method for the max-cut problem (Q1761827) (← links)
• On the linear relaxation of the \(s-t\)-cut problem with budget constraints (Q2225051) (← links)
• A novel formulation of the max-cut problem and related algorithm (Q2287710) (← links)
• Improved semidefinite bounding procedure for solving max-cut problems to optimality (Q2436651) (← links)
• Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation (Q2475315) (← links)
• Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition (Q2583135) (← links)
• A continuation algorithm for max-cut problem (Q2644353) (← links)
• Strengthened semidefinite programming relaxations for the max-cut problem. (Q2768060) (← links)
• Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs (Q2784422) (← links)
• Self-Regular Interior-Point Methods for Semidefinite Optimization (Q2802533) (← links)
• (Q3093399) (← links)
• (Q5425124) (← links)