I'm having some issues with tspsol. When I regenerate the cost function
using the optimal tour I do not get the same result. Hence, I'm wondering
if I'm possibly doing something stupid extracting the solution.
(I'm using a symmetric TSP defined with a lower diagonal matrix)
grep '*' example.out | cut -b 8-18 | cut -f 1 -d '*' | awk -F- '{printf("edge(%d) = %d
<-> %d\n",NR,$1,$2);}'
Another aspect: Can it possibly be overflow issues? I have fractional
values < 50 that I multiply with 1e6 and round to get integers. Is there
a limit on the number of bits for the edge weights?
With best regards
Oscar Gustafsson
_______________________________________________
Help-glpk mailing list
[email protected]
http://lists.gnu.org/mailman/listinfo/help-glpk
