Prize-collecting generalized minimum spanning tree: Instances
收藏NIAID Data Ecosystem2026-05-02 收录
官方服务:
资源简介:
Instances for the prize-collecting generalized minimum spanning tree problem. The original set contains the instances group G1 provided by MARZO, R. G.; RIBEIRO, C. C. in the article "A GRASP with path-relinking and restarts heuristic for the prize-collecting generalized minimum spanning tree problem." The others groups CC, \mu3, \mu5, \mu7 and \mu9 were provided by CONTRERAS-BOLTON, C.; PARADA, V MARZO, R. G.; RIBEIRO, C. C. in "An effective two-level solution approach for the prize-collecting generalized minimum spanning tree problem by iterated lo- cal search." The set of reduced instances contains the same instances with applying the reduced rules.
创建时间:
2025-03-16



