Pages that link to "Item:Q1751250"
From MaRDI portal
The following pages link to Projection results for the \(k\)-partition problem (Q1751250):
Displaying 7 items.
- Computational study of valid inequalities for the maximum \(k\)-cut problem (Q1657394) (← links)
- A two-level graph partitioning problem arising in mobile wireless communications (Q1744904) (← links)
- Global optimization of multilevel electricity market models including network design and graph partitioning (Q2010915) (← links)
- Exploiting sparsity for the min \(k\)-partition problem (Q2175445) (← 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)
- On Integrality in Semidefinite Programming for Discrete Optimization (Q6130544) (← links)
