Data Structures for Traveling Salesmen

@article{Fredman1993DataSF,
  title={Data Structures for Traveling Salesmen},
  author={Michael L. Fredman and David S. Johnson and Lyle A. McGeoch and G. Ostheimer},
  journal={J. Algorithms},
  year={1993},
  volume={18},
  pages={432-479}
}
The choice of data structure for tour representation plays a critical role in the efficiency of local improvement heuristics for the Traveling Salesman Problem. The tour data structure must permit queries about the relative order of cities in the current tour and must allow sections of the tour to be reversed. The traditional array-based representation of a tour permits the relative order of cities to be determined in small constant time, but requires worst-case Ω(N) time (where N is the number… CONTINUE READING
Highly Influential
This paper has highly influenced 12 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 52 extracted citations

References

Publications referenced by this paper.
Showing 1-4 of 4 references

Quick updates for p-opt TSP heuristics,’

  • F. MARGOT
  • Operations Res. Lett
  • 1992
Highly Influential
5 Excerpts

SZYMACHA, AND A. KRAWCZYK, ‘‘A data structure useful for finding Hamiltonian cycles,’

  • T. M. CHROBAK
  • Theor. Comput. Sci
  • 1990
Highly Influential
7 Excerpts

BENTLEY, ‘‘Fast algorithms for geometric traveling salesman problems,’

  • J L.
  • ORSA J. Comput
  • 1992
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…