note
JavaFan
<blockquote><em>I've developed a brute-force solution for a local transfer company which works fine BUT it uses a pure perl encoded version of the Dijkstra algorithm. This works fine, but proves to be the main consumer of CPU time (according to the superb NYTProf profiler)</em></blockquote>
You solved the travelling salesman problem by using <em>Dijkstra's algorithm</em>???
<p>
Seriously man, you shouldn't worry about your CPU time, you should worry about how to contact the Clay Mathematics Institute and cash your million dollar reward.
<p>
You've solved the top problem of the <a href="https://en.wikipedia.org/wiki/Millennium_problem">Millennium problems</a> (P =?= NP) as defined by the Clay Mathematics Institute, each of them having a million dollar reward for solving them.
969487
969487