Pages that link to "Item:Q1657394"

The following pages link to Computational study of valid inequalities for the maximum \(k\)-cut problem (Q1657394):

Displayed 8 items.

• A two-level graph partitioning problem arising in mobile wireless communications (Q1744904) ‎ (← links)
• Exploiting sparsity for the min \(k\)-partition problem (Q2175445) ‎ (← links)
• A class of spectral bounds for max \(k\)-cut (Q2181211) ‎ (← links)
• An exact approach for the multi-constraint graph partitioning problem (Q2219514) ‎ (← links)
• A branch-and-bound algorithm for solving max-\(k\)-cut problem (Q2231324) ‎ (← links)
• Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints (Q2287849) ‎ (← links)
• Computational study of a branching algorithm for the maximum \(k\)-cut problem (Q2673248) ‎ (← links)
• A semidefinite relaxation based global algorithm for two-level graph partition problem (Q2698612) ‎ (← links)