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

Description

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.

Links & Downloads

1. https://scholarworks.lib.csusb.edu/etd-project/1844
2. https://scholarworks.lib.csusb.edu/cgi/viewcontent.cgi?article=2844&context=etd-project

Tags

Traveling-salesman problem

Computer algorithms

Combinatorial optimization

Additional Fields

Identifer	oai:union.ndltd.org:csusb.edu/oai:scholarworks.lib.csusb.edu:etd-project-2844
Date	01 January 2001
Creators	Holland, Eric
Publisher	CSUSB ScholarWorks
Source Sets	California State University San Bernardino
Detected Language	English
Type	text
Format	application/pdf
Source	Theses Digitization Project