Code and Data Repository for A new upper bound for the Euclidean TSP constant
用计算机辅助证明和决策树方法，为欧几里得旅行商问题常数构造了一个新的上界，虽然改进幅度不大，但方法主要受限于硬件，便于未来优化。
This paper presents a computer-aided proof of a novel approach to constructing a new upper bound for the Euclidean Traveling Salesman Problem (TSP) Constant, leveraging numerical methods and decision trees. While the improvement achieved is modest, the approach offers a key advantage: it is primarily constrained by computer hardware, making it highly amenable to further optimization and advancements over time.