capacityscalingalgorithm

# capacityscalingalgorithm - 15.082 and 6.855J The Capacity...

This preview shows pages 1–9. Sign up to view the full content.

15.082 and 6.855J The Capacity Scaling Algorithm

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

View Full Document
2 The Original Costs and Node Potentials 1 2 3 5 4 4 1 2 2 5 6 7 0 0 0 0 0
3 The Original Capacities and Supplies/Demands 1 2 3 5 4 10 20 20 25 25 20 30 23 5 -7 -19 -

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

View Full Document
4 Set = 16. This begins the -scaling phase. 1 2 3 5 4 10 20 20 25 25 20 30 23 5 -7 -19 We send flow from nodes with excess to nodes with deficit ≥∆ . We ignore arcs with capacity ≤∆ . -
5 Select a supply node and find the shortest paths 1 2 3 5 4 4 1 2 2 5 6 7 7 0 6 8 8 shortest path distance The shortest path tree is marked in bold and blue.

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

View Full Document
6 Update the Node Potentials and the Reduced Costs 1 2 3 5 4 4 1 2 2 5 6 7 0 -7 -8 -8 -6 0 0 0 0 6 3 1 To update a node potential, subtract the shortest path distance.
7 Send Flow Along a Shortest Path in G(x, 16) 1 2 3 5 4 1 Send flow from node 1 to node 5. 20 20 25 25 20 30 23 5 -2 -7 -19 How much flow should be sent? 10

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

View Full Document
Update the Residual Network 1 2 3 5 4 1 19 units of flow were sent from node 1 to node 5. 20
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 03/15/2010 for the course IE 505 taught by Professor Yok during the Spring '10 term at Galatasaray Üniversitesi.

### Page1 / 27

capacityscalingalgorithm - 15.082 and 6.855J The Capacity...

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

View Full Document
Ask a homework question - tutors are online