Back to search
CSUniversity San Bernardino
The traveling salesman problem improving K-opt via edge cut equivalence sets
Abstract
dc:description.abstractThe 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.
Degree
thesis:*- Name thesis:degree_name
- Master of Science in Computer Science
- Level thesis:degree_level
- Thesis
- Discipline thesis:degree_discipline
- School of Computer Science and Engineering
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Holland, Eric
Subjects
dc:subject × 4Identifiers
dc:identifier.*- Repository record dc:identifier
- https://scholarworks.lib.csusb.edu/etd-project/1844