A Multiple Search Operator Heuristic for the Max-k-cut Problem

Fuda Ma, Jin-Kao Hao

The max-k-cut problem is to partition the vertices of a weighted graph $G=(V,E)$ into $k\ge 2$ disjoint subsets such that the weight sum of the edges crossing the different subse…