Timeline for The fastest algorithm for asymmetric travelling salesman problem (TSP)
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 27, 2011 at 20:57 | vote | accept | igor | ||
| Apr 27, 2011 at 20:57 | |||||
| Apr 15, 2011 at 4:18 | comment | added | Dukes | Not really sure what you mean to be honest. There are definitely a lot of ways to do this and the way I said is just what I thought of offhand. | |
| Apr 13, 2011 at 13:03 | comment | added | igor | Is it possible to add backward distances (points) (a->b - direct, b->a backward distances) to find optimal path (just moving a mind from two dimension field)? What do you think about? | |
| Apr 13, 2011 at 1:06 | history | answered | Dukes | CC BY-SA 3.0 |