Connected Max-k-Cut Problem instances
收藏Recherche Data Gouv France2022-01-01 更新2026-04-09 收录
下载链接：
https://entrepot.recherche.data.gouv.fr/citation?persistentId=doi:10.12763/CLWL3A
下载链接
链接失效反馈官方服务：
资源简介：
This instances correspond to the instances used in the article "A branch-and-cut algorithm for the Connected Max-k-Cut Problem" - winstance: randomly generated instances - deginstance: the same instance after the vertex reordering The file format is described in the provided README.md file.
创建时间：
2022-01-01
