CiteULike is a free online bibliography manager. Register and you can start organising your references online.

On the Neighborhood Structure of the Traveling Salesman Problem Generated by Local Search Moves Export

Journal of Statistical Physics, Vol. 129, No. 4. (1 November 2007), pp. 623-648.

Citation Format

[Posts]

View FullText article


naveer's tags for this article

local_search tsp

X Reviews [Write a review of this article]

X Find related articles from these CiteULike users

X Find related articles with these CiteULike tags

X Posting History

X Abstract

Abstract   When trying to find approximate solutions for the Traveling Salesman Problem with heuristic optimization algorithms, small moves called Lin-k-Opts are often used. In our paper, we provide exact formulas for the numbers of possible tours into which a randomly chosen tour can be changed with a Lin-k-Opt. Furthermore, we compare the quality of the results to which the various moves lead.


X BibTeX record

X RIS record


Privacy Statement | Terms & Conditions
CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.