z-logo
open-access-imgOpen Access
A branch-and-cut-and-price algorithm for the connected max-$k$-cut problem
Author(s) -
Nicolas Jozefowiez
Publication year - 2022
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - maximum cut , branch and cut , algorithm , computer science , mathematics , integer programming , theoretical computer science , graph

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom