The TSMP-1 (Traveling SalesMan Problem) code is intended for solving the problem of the precise determination of the length and path of a minimal Hamiltonian cycle (cycles) of a weighed network (the Traveling Salesman Problem, the TSP) in a time that polynomially depends on the network’s dimension (the number of its nodes); and it also relates to the construction (on this basis) of algorithms of polynomial complexity to solve so-called NP-complete problems of discrete mathematics. The research program including the source code and documentation can be obtained from the downloading page (TSMP-1.zip file). Input and output files from TSPLIB – Gerd Reinelt’s library of TSP instances – are included in the package.