The minimum sum

In this paper, we propose an idea of TSP-algorithm for any graph. 1 Introduction and results The traveling salesman problem (TSP) is equivalent to the phenomena of bee colony. The algorithm which is based on the phenomena can be con-structed [Kar05]. In this paper, we use the arithmetical approach to the TSP. In general, the weighted graph has a minimum and maximum. Indeed