Hi everybody.
I'm from Poland and I study operation research on Uniwersity
of Lodz. I'm writing magisterium now an I need help. Topic
of my work is Travelling Salesman Problem. I must use three
algorithmus: Little's, Lin-Kernighan's and Hungarians. If
somebody has got materials or knows links to theory about
this algorithmus, please write me. I must programming this
algorithmus in Turbo Pascal. Did somebody write this
program? Please help. In my country nobody can help me.
Thanks.
Kosmosek.
--
Serwis Usenet w portalu Gazeta.pl -> http://www.gazeta.pl/usenet/
Sysop: | Keyop |
---|---|
Location: | Huddersfield, West Yorkshire, UK |
Users: | 300 |
Nodes: | 16 (0 / 16) |
Uptime: | 117:55:44 |
Calls: | 6,704 |
Calls today: | 4 |
Files: | 12,235 |
Messages: | 5,349,333 |