Brucato, Corinne
(2013)
The Traveling Salesman Problem.
Master's Thesis, University of Pittsburgh.
(Unpublished)
Abstract
Although a global solution for the Traveling Salesman Problem does not yet exist, there are algorithms for an existing local solution. There are also necessary and sufficient conditions to determine if a possible solution does exist when one is not given a complete graph. This paper gives an introduction to the Traveling Sales- man Problem that includes current research. Additionally, the algorithms are used to find a route traveling through twenty US colleges. As well, we use the Geometric Algorithm to assign scouts for the Pittsburgh Pirates.
Share
Citation/Export: |
|
Social Networking: |
|
Details
Item Type: |
University of Pittsburgh ETD
|
Status: |
Unpublished |
Creators/Authors: |
|
ETD Committee: |
|
Date: |
30 June 2013 |
Date Type: |
Publication |
Defense Date: |
16 April 2013 |
Approval Date: |
30 June 2013 |
Submission Date: |
20 May 2013 |
Access Restriction: |
No restriction; Release the ETD for access worldwide immediately. |
Number of Pages: |
57 |
Institution: |
University of Pittsburgh |
Schools and Programs: |
Dietrich School of Arts and Sciences > Mathematics |
Degree: |
MS - Master of Science |
Thesis Type: |
Master's Thesis |
Refereed: |
Yes |
Uncontrolled Keywords: |
Traveling Salesman |
Date Deposited: |
30 Jun 2013 16:49 |
Last Modified: |
15 Nov 2016 14:12 |
URI: |
http://d-scholarship.pitt.edu/id/eprint/18770 |
Metrics
Monthly Views for the past 3 years
Plum Analytics
Actions (login required)
![View Item View Item](/style/images/action_view.png) |
View Item |