Advertisement

Minimum Spanning Trees

Chapter
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 140)

Abstract

GTC has been assigned the job of interconnecting six departments, labeled A, B, C, D, E, and F, of a university, at minimum cost. Practical considerations make it impossible to connect several pairs of departments directly to one another. In fact the only direct connections possible are the ones between departments A and B, A and D, B and C, B and D, B and E, C and D, C and F, D and E, and E and F. These connections are shown in the network of Figure 2.1, in which the nodes correspond to departments and edges correspond to possible direct connections. The numbers next to the edges denote the cost of making those connections in “100 units. GTC is required to connect the six departments as cheaply as possible.

Keywords

Span Tree Access Point Minimum Span Tree Steiner Tree Problem Linear Programming Formulation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  1. 1.Fac. Economische Wetenschappen Rijksuniversiteit GroningenGroningenThe Netherlands
  2. 2.Department of Production and Quantitative MethodsIndian Institute of ManagementVastrapuraIndia

Personalised recommendations