Pages that link to "Item:Q2287849"

The following pages link to Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints (Q2287849):

Displaying 10 items.

• Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837) (← links)
• A tight semidefinite relaxation of the MAX CUT problem (Q1417849) (← links)
• Computational study of valid inequalities for the maximum \(k\)-cut problem (Q1657394) (← links)
• Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results (Q2039061) (← links)
• On the linear relaxation of the \(s-t\)-cut problem with budget constraints (Q2225051) (← 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)
• Computational study of a branching algorithm for the maximum \(k\)-cut problem (Q2673248) (← links)
• (Q4558957) (← links)
• Cutting Plane Generation through Sparse Principal Component Analysis (Q5081781) (← links)