Skip to main navigation Skip to search Skip to main content

A branch-and-cut algorithm for the connected max-k-cut problem

  • Patrick Healy
  • , Nicolas Jozefowiez
  • , Pierre Laroche
  • , Franc Marchetti
  • , Sébastien Martin
  • , Zsuzsanna Róka
  • Université de Lorraine
  • Huawei Technologies

Research output: Contribution to journal › Article › peer-review

Fingerprint

Dive into the research topics of 'A branch-and-cut algorithm for the connected max-k-cut problem'. Together they form a unique fingerprint.
Sort by

Computer Science

Mathematics