Change search
ReferencesLink to record
Permanent link

Direct link
The Asymmetric Travelling Salesman Problem: A Linear Programming Solution Approach
KTH, School of Computer Science and Communication (CSC).
2014 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

The travelling salesman problem is a well known optimization problem. The goal is to nd theshortest tour that visits each city in a given list exactly once. Despite the simple problem statementit belongs to the class of NP-complete problems. Its importance arises from a plethora of applicationsas well as a theoretical appeal. The asymmetric TSP is not as well researched as the symmetric TSP,in this paper we focus on a solution approach suitable for the asymmetric case. We demonstrate howa linear programming formulation can be used to solve the problem. We also show the limitationsof this solution approach and provide suggestions for improving it.i

Place, publisher, year, edition, pages
National Category
Computer Science
URN: urn:nbn:se:kth:diva-157412OAI: diva2:769909
Available from: 2014-12-09 Created: 2014-12-09 Last updated: 2014-12-09Bibliographically approved

Open Access in DiVA

fulltext(435 kB)159 downloads
File information
File name FULLTEXT01.pdfFile size 435 kBChecksum SHA-512
Type fulltextMimetype application/pdf

By organisation
School of Computer Science and Communication (CSC)
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 159 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 63 hits
ReferencesLink to record
Permanent link

Direct link