How can we find the shortest way to go from one location to another? For many optimization problems very tricky algorithms are known that produce an optimal solution very quickly, and this problem is one of them. In this chapter the authors present the algorithm, and explain how the technique can be extended to other types of problems.
KeywordsShort Path Travelling Salesman Problem Priority Queue Travelling Salesman Thread Length
Unable to display preview. Download preview PDF.