A Quick Algorithm for Calculating the Lower Bound of Symmetric Traveling Salesman Problem
对称型TSP下界的快速估算法

Based on mathematical inference and proof, we propose a quick algorithm for calculating the lower bound of symmetric Travelling Salesman Problem. By using the algorithm, series of numerical examples of TSP(traveling salesman problem) from TSBLIB are solved and the computational results are compared with the best-known solutions published, which give promising results.