Next PreviousTable of Contents
KTsp optimizes Traveling Salesmen Problems (TSP). TSPs are sets of points through which the shortest way is wanted, starting in one particular point and ending in that point again. If n is the number of points the task of finding the shortest way is of the order of n!, thus it can't be found within a reasonable period for not too small n. In fact, KTsp usually doesn't find the shortest way but a fairly short one. For pratical use, that is good enough.
I wrote this piece of software as an decent example of programming with KDE to be included in my book "Programming with KDE". With the book published, I saw no reason not to release KTsp on its own.
Next PreviousTable of Contents