• DOI:10.1007/978-3-642-40328-6_13
Corpus ID: 8110696

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

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed

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.