Multiple Traveling Salesmen in Asymmetric Metrics

@article{Friggstad2013MultipleTS,
  title={Multiple Traveling Salesmen in Asymmetric Metrics},
  author={Zachary Friggstad},
  journal={ArXiv},
  year={2013},
  volume={abs/1112.2930}
}
  • Zachary Friggstad
  • Published 2013
  • Mathematics, Computer Science
  • ArXiv
  • We consider some generalizations of the Asymmetric Traveling Salesman Path Problem. In these variants, we have multiple salesmen that we are to move around a metric and the goal is to have each node visited by at least one salesman. This should be done while minimizing the total distance travelled by all salesmen. 
    4 Citations

    References

    SHOWING 1-10 OF 48 REFERENCES
    On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
    • 262
    Matroid Intersection and its application to a Multiple Depot, Multiple TSP
    • 3
    Traveling salesman path problems
    • 39
    • PDF
    On the LP Relaxation of the Asymmetric Traveling Salesman Path Problem
    • 3
    • PDF
    Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs
    • 74
    • PDF
    An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem
    • 125
    • PDF
    Analysis of Christofides ' heuristic : Some paths are more difficult than cycles
    • 147
    • PDF
    Analysis of Christofides' heuristic: Some paths are more difficult than cycles
    • H. Hoogeveen
    • Computer Science, Mathematics
    • Oper. Res. Lett.
    • 1991
    • 56
    • PDF
    ANALYSIS OF THE HELD-KARP HEURISTIC FOR THE TRAVELING SALESMAN PROBLEM
    • 43
    • PDF