Problem Instances from Jovanovic et al. (2010)

该数据集包含1060个问题实例，分为两种类型（T1和T2）和两个类别（SMPI和LPI），以评估所提出方法的表现。在类型T1的实例中，顶点的权重在[20, 70]区间内均匀分布，而类型T2的权重则是随机选择在[1, δ(i)^2]区间内，其中δ(i)是顶点i的度数。数据集的规模分为320个中小实例，这些实例拥有50至250个顶点和50至5000条边；以及210个大型实例，这些实例拥有300至1000个顶点和最多20000条边。该任务旨在解决最小权重支配集问题。

This dataset contains 1060 problem instances, which are categorized into two types (T1 and T2) and two classes (SMPI and LPI), for evaluating the performance of the proposed method. For instances of type T1, the weights of vertices are uniformly distributed within the interval [20, 70]; for type T2, the weights are randomly selected within the interval [1, δ(i)²], where δ(i) denotes the degree of vertex i. The dataset is split into 320 small-to-medium-sized instances, which have 50 to 250 vertices and 50 to 5000 edges; and 210 large-scale instances, which have 300 to 1000 vertices and up to 20000 edges. This task aims to solve the minimum weight dominating set problem.