What is it about?
This article explains how to change the standard Assignment problem matrix to find the shortest route from start to finish with distances, time or cost table as an assignment problem in Excel. Also shown is how to add one or two stops as necessary "cities" in the shortest route path.
Featured Image
Why is it important?
This article expands the use of the traditional nXn Assignment problem to be used for routing problems.
Perspectives
Read the Original
This page is a summary of: SOLUTION OF THE SHORTEST ROUTE PROBLEM USING THE ASSIGNMENT TECHNIQUE, Decision Sciences, January 1972, Wiley,
DOI: 10.1111/j.1540-5915.1972.tb00522.x.
You can read the full text:
Contributors
The following have contributed to this page