Skip to main content

Table 5. Numerical results on the classical TSP problem

From: Mixed Integer Programming Formulations for the Balanced Traveling Salesman Problem with a Lexicographic Objective

Instance Time to optimal (s) Standard time to optimal (s)
0010 0 0
0015 0 0
0020 0 0
0025 0 0
0030 0 0
0040 0 0
0050 0 0
0060 0 0
0070 0 0
0080 0 0
0090 0 0
0100 0 0
0150 0 0
0200 0 0
0250 0 0
0300 0 0
0400 0 0
0500 0 0
0600 0 0
0700 0 0
0800 0 0
0900 0 0
1000 1 1
1500 0 0
2000 2 2
2500 4 3
3000 2 2