Minimum-Cost Paths for a System Composed of Ordinary Routes and a Special Network of Cheap Routes

An algorithm is presented for determining the minimum-cost paths through a system consisting of ordinary routes and a restricted network of cheap routes. The number of computations required using the algorithm is in general considerably less than for a comparison of all possible paths for each journey.