Large instances for min-max regret traveling salesman problem

This dataset is related to the Data in the article titled: “New heuristic approaches for the min-max regret traveling salesman problem.” The dataset includes 100 random instances.
In each file, the first row shows the number of vertices (n). The second to (n+1)-th rows represent each edge, consisting of four values separated by spaces: the edge tail, the edge head, the lower bound of the edge cost, and the upper bound of the edge cost.