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
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3831 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | gamegame | 3386 |
| 10 | ksun48 | 3373 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 5 | -is-this-fft- | 158 |
| 6 | awoo | 157 |
| 7 | adamant | 156 |
| 8 | TheScrasse | 154 |
| 8 | nor | 154 |
| 10 | Dominater069 | 153 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/05/2024 14:01:39 (i1).
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.