> So this wil probably give around 600*600 shortest distances.
Do you really need to know all the distances or you need to solve
some high-level problem using the distances as an intermediate result?
If the former, I am just wondering how you are going to use such huge
amount of information. :+)
hello Rik
I'm also facing the same problem in shortest path,if you have got some help
please forward me too,as
I'm also working on it,it will be of great help to me
thanking you
ashutosh.natraj
my mail id: [EMAIL PROTECTED]
[EMAIL PROTECTED]
hello all,
I'd like to pose a prob
Hello everybody
I'm a student at TUD,germany working with Gnu Lpk Mathprogram,its a error in
the shortest distance between nodes problem in optimization problem,
so i would like to seek your help,if i get some worked out sample ,so that i
can proceed further in my work,its showing me either lit
> is it possible to write a n-dimensional array (in my case 3-D) into a
> Mathprog
> data file to be used by GLPK? If so, how? Thanks for the help, Jan
Sure. Please look at the example model 'train.mod' included in the glpk
distribution.
___
Help-glpk
