On the high multiplicity traveling salesman problem

@article{Grigoriev2006OnTH,
  title={On the high multiplicity traveling salesman problem},
  author={Alexander Grigoriev and Joris van de Klundert},
  journal={Discrete Optimization},
  year={2006},
  volume={3},
  pages={50-62}
}
This paper considers a version of the traveling salesman problem where the cities are to be visited multiple times. Each city has its own required number of visits. We investigate how the optimal solution and its objective value change when the numbers of visits are increased by a common multiplicator. In addition, we derive lower bounds on values of the multiplicator beyond which further increase does not improve the average tour length. Moreover, we show how and when the structure of an… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 16 references

Theory of linear and integer programming

Wiley-Interscience series in discrete mathematics and optimization • 1999
View 3 Excerpts
Highly Influenced

Agnetis , No - wait flowshop scheduling with large lot size

F. Magnanti T. Ahuja, D. Orlin
Annals of Operations Research • 1997

A note on the high multiplicity traveling salesman problem, Working Paper, Maastricht

J. Van de Klundert
1995
View 2 Excerpts

Network Flows

T. Ahuja, F. Magnanti, D. Orlin
Wiley Interscience, San Francisco • 1994
View 1 Excerpt

Similar Papers

Loading similar papers…