SOLUTION OF THE SHORTEST ROUTE PROBLEM USING THE ASSIGNMENT TECHNIQUE
Rick Hesse · Decision Sciences · 1972
ABSTRACT A solution to the shortest route problem of going from city i to city j with p necessary intermediate stops (0 p n ‐ 2) is given using the assignment algorithm, with a simple modification of the initial matrix. A branch and bound algorithm is necessary in all but the simplest case (p = 0).