Timeline for Finding the shortest path through a digraph that visits all nodes
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 21, 2014 at 14:16 | comment | added | Boluc Papuccuoglu | Let's say that I add a 2-metric edge from V1 to V3 (which aren't connected in the original graph), passing through V2. Now, if the solution includes this edge, V2 does not actually need to be visited. However, the TSP solver WILL try to include V2 in its final solution, taking it away from the optimal. How can I prevent this? | |
| Aug 21, 2014 at 13:22 | history | answered | ratchet freak | CC BY-SA 3.0 |