Question: A limousine company must process pickup requests every day, for taking customers from their various homes to the local airport. Suppose this company receives pickup
A limousine company must process pickup requests every day, for taking customers from their various homes to the local airport. Suppose this company receives pickup requests from n locations and there are n limos available, where the distance of limo i to location j is given by a number, dij. Describe an efficient algorithm for computing a dispatchment of the n limos to the n pickup locations that minimizes the total distance traveled by all the limos.
Step by Step Solution
3.41 Rating (167 Votes )
There are 3 Steps involved in it
We are interested in a minimumcost matching of limos to locat... View full answer
Get step-by-step solutions from verified subject matter experts
