THE PROBLEM:
A bank has about 100 branches throughout the country. To reduce the amount of traveling required for face-to-face meetings, the management has decided to install advance video conferencing (VC) facilities in all branches. In order to install this VC facility, the service provider has to connect-up the branches with optical fiber links. The service provider charges different amount of installation fees to connect diffrerent pairs of branches. However, it is not possible to connect up every possible pairs of branches due to the high cost. You want a set of fiber links that connects all the branches with a minimum total cost. Assume that each branch can be used as a routing point for the VC traffic.
1 how can I develope an algorithmic solution to this problem using VDM.