On the exact number of possibilities for cutting and reconnecting the tour of a traveling salesman with Lin-$k$-Opts

Physics – Computational Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

13 pages, 4 figures

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

On the exact number of possibilities for cutting and reconnecting the tour of a traveling salesman with Lin-$k$-Opts does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the exact number of possibilities for cutting and reconnecting the tour of a traveling salesman with Lin-$k$-Opts, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the exact number of possibilities for cutting and reconnecting the tour of a traveling salesman with Lin-$k$-Opts will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-31380

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.