Skip to main content

Table 3. Numerical results on the balanced spanning-tree problem

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

Instance Lited lower bound Lifted upper bound Standard lower bound Standard upper bound
0010 60 60 60 60
0015 129 129 4 173
0020 143 143 0 242
0025 222 222 0 430
0030 247 247 0 247
0040 241 840 0 720
0050 378 378 0 1.036
0060 389 394 0 1.071
0070 375 375 0 1.238
0080 369 369 0 1.167
0090 342 342 0 1.300
0100 525 525 0 2.313
0150 855 855 0 2.476
0200 925 925 0 4.311
0250 1.170 1.170 0 3.236
0300 1.471 1.471 0 4.854
0400 2.099 2.109 0 7.493
0500 2.619 2.629 0 6.942
0600 0 2.917 0 10.381
0700 0 3.864 0 15.749
0800 0 4.319 0 15.649
0900 325 4.189 0 18.736
1000 386 5.188 0 21.090
1500 0 20.396 0 32.876
2000 0 23.264 0 45.489
2500 0 24.583 0 30.485
3000 0 28.297 0 13.466