Statistical analysis of frequency graph for traveling salesman problem
Yong Wang · Journal of Intelligent & Fuzzy Systems · 2015
Traveling salesman problem (TSP) is a typical of combinatorial optimization problem. Its objective is to find an optimal Hamiltonian circuit (OHC). It has been proven to be NP-complete. The frequency graph for TSP has been introduced in a previous pa