Back to search

CSUniversity San Bernardino - Retro

The traveling salesman problem improving K-opt via edge cut equivalence sets

Abstract

dc:description.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.

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 × 4

Identifiers

dc:identifier.*
Repository record dc:identifier
https://scholarworks.lib.csusb.edu/etd-project/1844

Chain of custody

source
Harvested from
CSUniversity San Bernardino - Retro
Base URL
scholarworks.lib.csusb.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Holland, Eric. The traveling salesman problem improving K-opt via edge cut equivalence sets. Thesis thesis, https://scholarworks.lib.csusb.edu/etd-project/1844