Computational study of a branching algorithm for the maximum k-cut problem

Vilmar Jefté Rodrigues de Sousa, Miguel F. Anjos, Sébastien Le Digabel. Computational study of a branching algorithm for the maximum k-cut problem. Discrete Optimization, 44(Part):100656, 2022. [doi]

@article{SousaAD22,
  title = {Computational study of a branching algorithm for the maximum k-cut problem},
  author = {Vilmar Jefté Rodrigues de Sousa and Miguel F. Anjos and Sébastien Le Digabel},
  year = {2022},
  doi = {10.1016/j.disopt.2021.100656},
  url = {https://doi.org/10.1016/j.disopt.2021.100656},
  researchr = {https://researchr.org/publication/SousaAD22},
  cites = {0},
  citedby = {0},
  journal = {Discrete Optimization},
  volume = {44},
  number = {Part},
  pages = {100656},
}