Transcription of The Traveling Salesman Problem
{{id}} {{{paragraph}}}
THE Traveling Salesman PROBLEMbyCorinne , Sonoma State University, , University of Pittsburgh, 2013 Submitted to the Graduate Faculty ofthe Department of Mathematics in partial fulfillmentof the requirements for the degree ofMaster of SciencesUniversity of Pittsburgh2013 UNIVERSITY OF PITTSBURGHMATHEMATICS DEPARTMENTThis thesis was presentedbyCorinne BrucatoIt was defended onApril 16, 2013and approved byDr. Jeffrey Paul Wheeler, University of Pittsburgh, MathematicsDr. Beverly Michael, University of Pittsburgh, MathematicsDr.
The traveling salesman problem can be divided into two types: the problems where there is a path between every pair of distinct vertices (no road blocks), and the ones where there are not (with road blocks).
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}