Timeline for Heuristic for optimising the traveling salesman problem (tsp) in under O(n²)
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 12, 2017 at 18:17 | history | edited | TheCatWhisperer | CC BY-SA 3.0 | added 28 characters in body |
| Oct 12, 2017 at 18:12 | comment | added | Dunk | Not only is it "might be a good idea", I'd venture to say that is a prerequisite for any idea if you want to turn one of the n's in 'n * n' to 'n * log(n)' | |
| Oct 12, 2017 at 17:07 | history | edited | TheCatWhisperer | CC BY-SA 3.0 | deleted 1 character in body |
| Oct 12, 2017 at 16:41 | vote | accept | FSMaxB | ||
| Oct 12, 2017 at 16:41 | comment | added | FSMaxB | Hm. Thanks. Dividing it into smaller sets and then using a more complex algorithm on them might be a good idea. Because the maximum distance between two data points is limited to 6, I can probably find a good way to divide the data set and stitch it back together in the end. Maybe I don't even need more than one hierarchy. | |
| Oct 12, 2017 at 15:18 | history | edited | TheCatWhisperer | CC BY-SA 3.0 | added 406 characters in body |
| Oct 12, 2017 at 15:12 | history | answered | TheCatWhisperer | CC BY-SA 3.0 |