The following pages link to (Q4737533):
Displaying 16 items.
- A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem (Q408371) (← links)
- Orbitopal fixing (Q408377) (← links)
- NP-hardness of the Euclidean Max-Cut problem (Q471386) (← links)
- A multiple search operator heuristic for the max-k-cut problem (Q513573) (← links)
- A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem (Q646707) (← links)
- New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (Q896848) (← links)
- A two-level graph partitioning problem arising in mobile wireless communications (Q1744904) (← links)
- Projection results for the \(k\)-partition problem (Q1751250) (← links)
- Political districting to minimize cut edges (Q2099493) (← links)
- Exploiting sparsity for the min \(k\)-partition problem (Q2175445) (← links)
- A class of spectral bounds for max \(k\)-cut (Q2181211) (← 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)
- Graphs and Algorithms in Communication Networks on Seven League Boots (Q3404458) (← links)
