Input data for ‘A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks’

Qinghua Wu · Data Archiving and Networked Services (DANS) · 2020

This data includes all the input data for the test instances used in the experiments. The input data consists of three sets of benchmarks including OR-Lib set (40 graphs), TSP-Lib set (20 graphs) and University of Florida Sparse Matrix Collection (3 graphs) .

Read the paper · More papers on PaperTik