Instances for “A Branch-and-Cut Approach for the Weighted Target Set Selection Problem on Social Networks”

We provide the instances used in the paper “A Branch-and-Cut Approach for the Weighted Target Set Selection Problem on Social Networks”, by S. Raghavan and Rui Zhang, published in the INFORMS Journal on Optimization (https://doi.org/10.1287/ijoo.2019.0012) . This repository contains the 260 instances used in the paper.

All the instances used in the paper are provided in a compressed archive. The accompanying data is contained in the following file:
--InstancesWTSS.zip

Description: There are two main folders: One called "Real-World Graphs" contains 180 instances based on real-world graphs. The other one called "Simulated Graphs" contains all instances based on simulated graphs. Within the Simulated Graphs folder, 50 200-node instances are in the "200 Nodes" folder and 30 large instances are in the "Large" folder.

For each text file, there are m+2 lines. The first m lines are the edges in the graphs. Nodes are labeled from 0 to n where n is the largest number in the first m lines. The (m+1)th line contains the weight (b) for each node. The (m+2)th line contains the threshold value (g) for each node.

The excel file “WTSS_Results.xlsx” reports, for each instance, the upper and lower bounds obtained in the paper.

本数据集提供了发表于《INFORMS优化杂志》（https://doi.org/10.1287/ijoo.2019.0012）的论文《针对社交网络中加权目标集选择问题的分支定界方法》（A Branch-and-Cut Approach for the Weighted Target Set Selection Problem on Social Networks），作者S. Raghavan和Rui Zhang所使用的实例。该存储库包含了论文中使用的260个实例。所有实例均以压缩归档形式提供。伴随数据存储于以下文件中：
--InstancesWTSS.zip

数据集描述如下：包含两大主要文件夹，其一命名为“Real-World Graphs”，内含基于现实世界图的180个实例；另一名为“Simulated Graphs”，包含所有基于模拟图的实例。在“Simulated Graphs”文件夹中，设有“200 Nodes”子文件夹，其中包含50个200节点实例，以及“Large”子文件夹，内含30个大型实例。

每个文本文件包含m+2行。前m行描述图中边的信息，节点从0至n进行标记，其中n为前m行中出现数值的最大值。第(m+1)行包含每个节点的权重（b）。第(m+2)行包含每个节点的阈值（g）。

Excel文件“WTSS_Results.xlsx”记录了每个实例在论文中获得的上下界。