Improving the linear relaxation of maximum k-cut with semidefinite-based constraints
We consider the maximum k-cut problem that involves partitioning the vertex set of a graph into k subsets such that the sum of the weights of the edges joining vertices in different subsets is maximized. The associated semidefinite programming (SDP) relaxation is known to provide strong bounds, but...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | article |
| Language: | EN |
| Published: |
Elsevier
2019
|
| Subjects: | |
| Online Access: | https://doaj.org/article/e83f83c8eb1e402f83fc6eed4310cd7b |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|