The problem below aims to find the minimum cost for the network architecture:

We want to build a network where client terminals are connected to servers by cabling which is very expensive. The network architecture should be designed to minimize the total cost of the cabling used.

It is assumed that $T=\{T_1,\ldots,T_n\}$ is the set of terminals. Cabling costs are known.

Show that it is possible to model this problem with a graph theory tool.

Can someone please help to initialize and how to process to solve this problem?

  • 2
    $\begingroup$ Hint: is it ever optimal for the network to contain a cycle? $\endgroup$ – RobPratt Jun 29 at 18:35
  • 1
    $\begingroup$ Welcome to OR.SE! This question feels like a homework problem. If so, that's fine, but please see Can I ask a homework question on OR.SE?. In particular, please make sure you explain what you have tried so far, and where you get stuck. $\endgroup$ – LarrySnyder610 Jun 29 at 20:07
  • 1
    $\begingroup$ A more descriptive title might help, too. $\endgroup$ – LarrySnyder610 Jun 29 at 20:09

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.