Hi guys! I'm looking forward to doing some research on well-known Traveling Salesman Problem. However, I never went into implementing this algorithm with some optimizations included as I don't know much about them. I tried googling, hoping to find some good resource of information about research on this particular problem, and was surprised not being able to find a good one. Does anyone know any good free e-book or anything similar which would guide me into details of this problem, as well as some optimizations and implementations, so I can try some of them and try to think about something clever myself, considering this problem? Thanks in advance!
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3880 |
| 2 | jiangly | 3669 |
| 3 | ecnerwala | 3654 |
| 4 | Benq | 3627 |
| 5 | orzdevinwang | 3612 |
| 6 | Geothermal | 3569 |
| 6 | cnnfls_csy | 3569 |
| 8 | jqdai0815 | 3532 |
| 9 | Radewoosh | 3522 |
| 10 | gyh20 | 3447 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | awoo | 161 |
| 2 | maomao90 | 160 |
| 3 | adamant | 156 |
| 4 | maroonrk | 153 |
| 5 | atcoder_official | 148 |
| 5 | -is-this-fft- | 148 |
| 5 | SecondThread | 148 |
| 8 | Petr | 147 |
| 9 | nor | 144 |
| 10 | TheScrasse | 142 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Jul/27/2024 15:04:40 (i2).
Desktop version, switch to mobile version.
Supported by
The first two hits from googling are Wikipedia (with multiple links at the bottom) and a devoted site at University of Waterloo.
If that is not enough for a start, please be more specific on what you are searching for.
Thanks for the Waterloo's article, I somehow didn't notice it.