Data for "The gradual minimum covering location problem"

Published: 22 April 2022| Version 1 | DOI: 10.17632/k4vkt3y5wf.1
Mostafa Khatami,


This is the data for the paper "The gradual minimum covering location problem", available at: There are 180 .csv fies in the data, containing 90 "nodes" files, denoted by "n_x_nodes", and 90 "population" files, denoted by "n_x_population", where n shown the number of nodes (n = 100, 200, 300, 400, 500, 1000, 2000, 5000, 10000) and x represents the instance ID (x = 1, ..., 10). The same instance file can be used for the two type of problems where p (the number of facilities) is 5 or 10. The "nodes" files represents the coordiante of the nodes, i.e., the 100-1-nodes contains 100 coordinates, each in one column, where the value in the first (second) row represents the x- (y-) coordinate of the node in a 200 by 200 grid. The "populaiton" files, contains the populaiton c of the respective nodes, that are numbers between 1 to 100.



University of Technology Sydney


Operations Research, Facility Location