G2 Instances for the Prize-Collecting Generalized MST Problem
收藏doi.org2025-03-22 收录
下载链接：
http://doi.org/10.17632/vbj5jrhz73.1
下载链接
链接失效反馈官方服务：
资源简介：
New instances for the Prize-Collecting Generalized Minimum Spanning Tree Problem.
Instruction to read the GTP file in Marzo and Ribeiro (2019): https://data.mendeley.com/datasets/vftc7kg6ty/2
Reference:
-----------
Marzo, R.G., Ribeiro, C.C., 2020. A GRASP with path-relinking and restarts heuristic for the prize-collecting generalized
minimum spanning tree problem. International Transactions in Operational Research 27, 3, 1419–1446.
关于奖励收集广义最小生成树问题的新实例。
指导阅读 Marzo 和 Ribeiro（2019）撰写的 GTP 文件：https://data.mendeley.com/datasets/vftc7kg6ty/2
参考文献：
Marzo, R.G., Ribeiro, C.C., 2020. 一种基于路径重连和重启策略的贪婪随机算法（GRASP）用于解决奖励收集广义最小生成树问题。国际运筹学交易 27, 3, 1419–1446。
提供机构：
Mendeley Data
