Before revision: The maximum traveling salesman problem (Max TSP) is one of the intensively researched combinatorial optimization problems. It consists of finding a maximum-weight Hamiltonian cycle in a given complete weighted graph.
After revision: The maximum traveling salesman problem (Max TSP) consists of finding a maximum-weight Hamiltonian cycle in a given complete weighted graph.