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.

本数据集与标题为《最小-最大后悔旅行商问题的新的启发式方法》的论文中的数据相关。数据集包含100个随机实例。每个文件的第一行显示顶点数（n）。从第二行至（n+1）行，每行代表一条边，由四个用空格分隔的值组成：边的尾端、边的头端、边的成本下界和边的成本上界。