The Asymmetric Traveling Salesman Problem
This thesis is a survey on the approximability of the asymmetric traveling salesmanproblem with triangle inequality (ATSP).In the ATSP we are given a set of cities and a function that gives the cost of travelingbetween any pair of cities. The cost function must satisfy the triangle inequality, i.e.t...
Main Author: | Mattsson, Per |
---|---|
Format: | Others |
Language: | English |
Published: |
Uppsala universitet, Matematiska institutionen
2010
|
Subjects: | |
Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-132624 |
Similar Items
-
An evaluation of solution-generating Algorithms for the asymmetric traveling salesman problem
by: McGuire, Randy L.
Published: (1983) -
Comparison of the Sub-Tour Elimination Methods for the Asymmetric Traveling Salesman Problem Applying the SECA Method
by: Ramin Bazrafshan, et al.
Published: (2021-02-01) -
Tight Flow-Based Formulations for the Asymmetric Traveling Salesman Problem and Their Applications to some Scheduling Problems
by: Tsai, Pei-Fang
Published: (2014) -
An implementation of a branch-and-cut algorithm for the travelling salesman problem
by: Geldenhuys, Christel Erna
Published: (2012) -
Contributions towards an implementation of a branch-and-cut algorithm for the travelling salesman problem
by: Leenen, Louise
Published: (2014)