| Speaker: | Yu Xia |
| School of Mathematics | |
| University of Birmingham |
Title: A continuous approach for the Max K-cut problem
Abstract:
The Max K-cut is reformulated as a continuous program. The vertex descent algorithms converges to a local optimal solution of the continuous program in finite steps. Numerical examples are given to compare the vertex descent algorithms with other software.
