2025/09/06 by Aggarwal, Minakshi
Mathematics · #Applied Mathematics #Benchmarking #Combinatorial Optimization #Computer Sciences #Discrete Mathematics and Combinatorics #Euclidean TSP #FOS: Mathematics #Mathematics #Numerical Analysis and Scientific Computing #Other Applied Mathematics #Other Physical Sciences and Mathematics #Physical Sciences and Mathematics #Polynomial Time Heuristic #Polynomial Tsp vs Held Karp TSP #Polynomial version of Held Karp #Route Optimization #Symmetri-Asymmetric-Blocked matrix Route optimization #TSP
paper · doi:10.17605/osf.io/yh9j7
This registration archives the research project “A Deterministic Polynomial-Time Algorithm for the Traveling Salesman Problem: Empirical and Structural Evidence.” It includes the theoretical formulation, algorithmic design, complexity analysis, experimental datasets, and evaluation results against Held–Karp verification and stress tests up to n=100. The purpose of this registration is to create a permanent, time-stamped scientific record of the work as submitted to peer-reviewed venues. It ensures transparency, reproducibility, and open access to supporting materials (code, data tables, and figures). Citation: Please cite this registration as the official archive of the TSP project.