Premium
SOLUTION OF THE SHORTEST ROUTE PROBLEM USING THE ASSIGNMENT TECHNIQUE
Author(s) -
HESSE RICK
Publication year - 1972
Publication title -
decision sciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.238
H-Index - 108
eISSN - 1540-5915
pISSN - 0011-7315
DOI - 10.1111/j.1540-5915.1972.tb00522.x
Subject(s) - simple (philosophy) , mathematical optimization , computer science , assignment problem , shortest path problem , matrix (chemical analysis) , algorithm , combinatorics , mathematics , chemistry , graph , philosophy , epistemology , chromatography
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).