<  Back to the Polytechnique Montréal portal

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

Vilmar Rodrigues de Sousa, Miguel F. Anjos and Sébastien Le Digabel

Technical Report (2020)

An external link is available for this item
Department: Department of Mathematics and Industrial Engineering
Research Center: GERAD - Research Group in Decision Analysis
PolyPublie URL: https://publications.polymtl.ca/64228/
Report number: G-2020-11
Official URL: https://www.gerad.ca/fr/papers/G-2020-11
Date Deposited: 28 Mar 2025 16:41
Last Modified: 28 Mar 2025 16:41
Cite in APA 7: Rodrigues de Sousa, V., Anjos, M. F., & Le Digabel, S. (2020). Computational study of a branching algorithm for the maximum k-cut problem. (Technical Report n° G-2020-11). https://www.gerad.ca/fr/papers/G-2020-11

Statistics

Stats are not available on this system.

Repository Staff Only

View Item View Item