A branch-and-bound algorithm for solving max-k-cut problem

Cheng Lu, Zhibin Deng. A branch-and-bound algorithm for solving max-k-cut problem. J. Global Optimization, 81(2):367-389, 2021. [doi]

@article{LuD21-4,
  title = {A branch-and-bound algorithm for solving max-k-cut problem},
  author = {Cheng Lu and Zhibin Deng},
  year = {2021},
  doi = {10.1007/s10898-021-00999-z},
  url = {https://doi.org/10.1007/s10898-021-00999-z},
  researchr = {https://researchr.org/publication/LuD21-4},
  cites = {0},
  citedby = {0},
  journal = {J. Global Optimization},
  volume = {81},
  number = {2},
  pages = {367-389},
}