Show simple item record

dc.contributor.advisorHolly Zullo
dc.contributor.advisorMark Parker
dc.contributor.advisorJoan Stottlemyer
dc.contributor.authorWendt, Theodore
dc.date.accessioned2020-04-30T10:08:15Z
dc.date.available2020-04-30T10:08:15Z
dc.date.issued2002-04-01
dc.identifier.urihttps://scholars.carroll.edu/handle/20.500.12647/3460
dc.description.abstractFinding an efficient algorithm for solving NP-Complete problems has long been a goal of computer scientists and mathematicians. The purpose of this paper is to examine existing heuristics (approximate algorithms) and to construct original heuristics for solving the Traveling Salesperson Problem, a famous NP-Complete problem. Each heuristic is implemented on a personal computer using C++. The results of the heuristics are then compared against the best known solutions for specific well-studied instances of the problem.
dc.titleThe Traveling Salesperson Problem: A Look At NP-Completeness and Methods For Finding Solutions
dc.typethesis
carrollscholars.object.degreeBachelor's
carrollscholars.object.departmentMathematics, Engineering & Computer Science
carrollscholars.object.disciplinesApplied Mathematics; Theory and Algorithms
carrollscholars.legacy.itemurlhttps://scholars.carroll.edu/mathengcompsci_theses/84
carrollscholars.legacy.contextkey11683437
carrollscholars.object.seasonSpring
dc.date.embargo12/31/1899 0:00


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record