Date of Award
Master of Science in Computer Science
School of Computer Science and Engineering
The traveling salesman problem (TSP) has become a classic in the field of combinatorial optimization. Attracting computer scientists and mathematicians, the problem involves finding a minimum cost Hamiltonian cycle in a weighted graph.
Holland, Eric, "The traveling salesman problem improving K-opt via edge cut equivalence sets" (2001). Theses Digitization Project. 1844.