Scribd
Upload
6 views1 page

Minimum Spanning Tree Analysis

This document summarizes the results of an optimization problem to find the minimum cost spanning tree for a network. It lists 12 potential branches between nodes, and identifies the 6 branches that were selected with a total cost of 1607. It then shows the steps of the solution, listing the starting and ending nodes of each selected branch along with its individual and cumulative costs.

Uploaded by

Carlos Alcántara
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
6 views1 page

Minimum Spanning Tree Analysis

This document summarizes the results of an optimization problem to find the minimum cost spanning tree for a network. It lists 12 potential branches between nodes, and identifies the 6 branches that were selected with a total cost of 1607. It then shows the steps of the solution, listing the starting and ending nodes of each selected branch along with its individual and cumulative costs.

Uploaded by

Carlos Alcántara
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Román Bautista Miguel Ángel

Carlos Alcántara Inv. Operaciones II


Module/submodel: Networks
Problem title: Arbol exp min
Starting node for iterations: 1

QM for Windows Results


Branch name Start node End node Cost Include Cost

Branch 1 1 2 224 Y 224

Branch 2 1 7 539

Branch 3 1 6 300 Y 300

Branch 4 6 7 283 Y 283

Branch 5 6 5 600

Branch 6 2 7 539

Branch 7 2 3 200 Y 200

Branch 8 3 7 600

Branch 9 3 4 400

Branch 10 4 7 200 Y 200

Branch 11 4 5 400 Y 400

Branch 12 5 7 447

Total 1607

Solution steps
Branch Starting node Ending node Cost Cumulative cost

Branch 1 1 2 224 224

Branch 7 2 3 200 424

Branch 3 1 6 300 724

Branch 4 6 7 283 1007

Branch 10 4 7 200 1207

Branch 11 4 5 400 1607

miércoles, 9 de octubre de 2019 06:07 p. m. 1 of 1

You might also like