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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.