<< Click here to display Table of Contents >> Navigation: LINGO 17.0 Users Manual > Developing More Advanced Models > Logistics Models > Shortest Route Problem Model: DYNAMB:
The Problem in Words
Suppose we have the following network of cities:
Links are assumed to be one-way. The distances between the cities are given to us. We want to determine the shortest distance between cities 1 and 10.