Computational study of valid inequalities for the maximum k-cut problem. - Vilmar Jefté Rodrigues de Sousa; Miguel F. Anjos; Sébastien Le Digabel (Ann. Oper. Res., 2018)

Improving the linear relaxation of maximum k-cut with semidefinite-based constraints. - Vilmar Jefté Rodrigues de Sousa; Miguel F. Anjos; Sébastien Le Digabel (EURO J. Comput. Optim., 2019)

Computational study of a branching algorithm for the maximum k-cut problem. - Vilmar Jefté Rodrigues de Sousa; Miguel F. Anjos; Sébastien Le Digabel (Discret. Optim., 2022)