Date of Award
2001
Document Type
Thesis
Degree Name
Master of Science in Computer Science
Department
School of Computer Science and Engineering
Abstract
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.
Recommended Citation
Holland, Eric, "The traveling salesman problem improving K-opt via edge cut equivalence sets" (2001). Theses Digitization Project. 1844.
https://scholarworks.lib.csusb.edu/etd-project/1844
