HW10Sol - Fall 2009 IEOR 160 Industrial Engineering...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Fall 2009 IEOR 160 Industrial Engineering & Operations Research November 29, 2009 Page 1 of 2 HOMEWORK 10 SOLUTIONS 1. Following Kruskals algorithm we first include the edge (1,2). Then we add in order the edges (9,12), (10,11), (5,6), (8,11), (11,12), (4,5), (6,9) and (1,4). At this moment there is a path from node 1 to node 12. The path is 1-4-5-8-11-12 and the maximum altitude is 5. 2. As long as the arc (i,j) does not disconnect the graph G , we can find the MST for G by adding an arc with minimum weight that does not create a cycle. Section 8.2 1. Since the graph is acyclic we can find the shortest path as follows: l (1) = 0. l (2) = l (1) + c 12 = 0 + 7 = 7 and b (2) = 1. l (3) = min { 0 + 12 , 7 + 7 } = 12 and b (3) = 1. l (4) = min { 0 + 21 , 7 + 12 , 12 + 7 } = 19 and b (4) = 2. l (5) = min { 0 + 31 , 7 + 21 , 12 + 12 , 19 + 7 } = 24 and b (5) = 3. l (6) = min { 0 + 44 , 7 + 31 , 12 + 21 , 19 + 12 , 24 + 7 } = 31 and b (6) = 4....
View Full Document

Page1 / 2

HW10Sol - Fall 2009 IEOR 160 Industrial Engineering...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online