and 6.855J Flow Decomposition

Slides:



Advertisements
Similar presentations
and 6.855J Cycle Canceling Algorithm. 2 A minimum cost flow problem , $4 20, $1 20, $2 25, $2 25, $5 20, $6 30, $
Advertisements

Outline LP formulation of minimal cost flow problem
DIJKSTRA’s Algorithm. Definition fwd search Find the shortest paths from a given SOURCE node to ALL other nodes, by developing the paths in order of increasing.
Applications of Maximum Flow and Minimum Cut Problems In this handout Transshipment problem Assignment Problem.
Network Optimization Models: Maximum Flow Problems In this handout: The problem statement Solving by linear programming Augmenting path algorithm.
NetworkModel-1 Network Optimization Models. NetworkModel-2 Network Terminology A network consists of a set of nodes and arcs. The arcs may have some flow.
15.082J, 6.855J, and ESD.78J September 21, 2010 Eulerian Walks Flow Decomposition and Transformations.
and 6.855J The Capacity Scaling Algorithm.
EMIS 8373: Integer Programming “Easy” Integer Programming Problems: Network Flow Problems updated 11 February 2007.
EMIS 8374 Network Flow Models updated 29 January 2008.
& 6.855J & ESD.78J Algorithm Visualization The Ford-Fulkerson Augmenting Path Algorithm for the Maximum Flow Problem.
The Ford-Fulkerson Augmenting Path Algorithm for the Maximum Flow Problem Thanks to Jim Orlin & MIT OCW.
Network Simplex Animations Network Simplex Animations.
15.082J and 6.855J and ESD.78J Network Simplex Animations.
Minimum Cost Flow Algorithms and Networks. Algorithms and Networks: Minimum Cost Flow2 This lecture The minimum cost flow problem: statement and applications.
Cycle Canceling Algorithm
Max-flow, Min-cut Network flow.
The minimum cost flow problem
Network Simplex Animations
Algorithms and Networks
Dijkstra’s Algorithm with two levels of buckets
Max-flow, Min-cut Network flow.
The Shortest Augmenting Path Algorithm for the Maximum Flow Problem
Introduction to Maximum Flows
Transportation, Assignment and Network Models
Introduction to Maximum Flows
15.082J & 6.855J & ESD.78J Visualizations
15.082J & 6.855J & ESD.78J Visualizations
Lecture 6 Shortest Path Problem.
Dijkstra’s Algorithm for the Shortest Path Problem
Breadth first search animation
Lecture 4 Graph Search.
Introduction to Minimum Cost Flows
Spanning Tree Algorithms
Primal-Dual Algorithm
Chapter 6 Network Flow Models.
Successive Shortest Path Algorithm
Successive Shortest Path Algorithm
and 6.855J March 6, 2003 Maximum Flows 2
Algorithms and Networks
15.082J & 6.855J & ESD.78J Radix Heap Animation
Network Optimization Depth First Search
Introduction to Algorithms
Min Global Cut Animation
Network Optimization Flow Decomposition.
Dijkstra’s Algorithm for Shortest Paths
The Shortest Augmenting Path Algorithm for the Maximum Flow Problem
Reading before Lecture 13
The Shortest Augmenting Path Algorithm for the Maximum Flow Problem
Network Optimization Topological Ordering
and 6.855J The Goldberg-Tarjan Preflow Push Algorithm for the Maximum Flow Problem Obtain a network, and use the same network to illustrate the.
and 6.855J Dijkstra’s Algorithm
Visualizations Dijkstra’s Algorithm
Introduction to Maximum Flows
Network Simplex Animations
and 6.855J The Goldberg-Tarjan Preflow Push Algorithm for the Maximum Flow Problem Obtain a network, and use the same network to illustrate the.
Eulerian Cycles in directed graphs
and 6.855J Topological Ordering
15.082J & 6.855J & ESD.78J Visualizations
Shortest Path Solutions
The Minimum Cost Spanning Tree Problem
and 6.855J Depth First Search
Breadth first search animation
OPIM 915 Fall 2010 Data Structures 23-38,
Introduction to Maximum Flows
Kramer’s (a.k.a Cramer’s) Rule
Max Flows 3 Preflow-Push Algorithms
Class 11 Max Flows Obtain a network, and use the same network to illustrate the shortest path problem for communication networks, the max flow.
EMIS The Maximum Flow Problem: Flows and Cuts Updated 6 March 2008
15.082J & 6.855J & ESD.78J Visualizations
Presentation transcript:

15.082 and 6.855J Flow Decomposition Obtain a network, and use the same network to illustrate the shortest path problem for communication networks, the max flow problem, the minimum cost flow problem, and the multicommodity flow problem. This will be a very efficient way of introducing the four problems. (Perhaps under 10 minutes of class time.)

begin Initialize while y   do Select(s, y) Search(s, y) if a cycle C is found then do let D = Capacity(C, y) Add Flow(D, C) to cycle flows Subtract Flow(D, C) from y. end if a path P is found then do let D = Capacity(P, y) Add Flow(D, P) to path flows Subtract Flow(D, P) from y.

The initial flow 7 2 4 4 3 3 8 2 1 6 -2 4 4 2 3 5 5 9 A supply node 7 2 4 4 3 3 8 2 1 6 -2 4 4 2 3 5 5 9 A supply node The flow x A demand node A balanced node

Find a Path or Cycle 7 2 4 4 3 3 8 2 1 1 6 -2 4 4 Carry out a depth first search until a cycle C or a path P is found Select a supply node 2 3 5 5 9 Determine the capacity The capacity is 2.

Update the decomposition 5 7 2 4 2 4 3 3 8 6 2 1 1 6 -2 4 4 Add the cycle flow to the decomposition 2 3 5 5 9 7 update the current flow 2 units around 1-2-4-5-3-1 cycle flows path flows

Find the next path or cycle 5 2 4 3 2 3 6 Start at a supply node and find the next cycle or path 2 1 1 6 -2 4 4 3 5 5 7 2 units around 1-2-4-5-3-1 cycle flows path flows

update the decomposition and current flow 2 5 2 4 3 2 3 6 3 update the current flow and decomposition 2 1 1 6 -2 4 4 3 5 5 7 4 2 units around 1-2-4-5-3-1 3 units around 2-4-5-3-2 cycle flows path flows

Find the next flow or cycle 2 2 4 3 2 start with a supply node and find the next flow or cycle. 3 2 1 1 6 -2 4 4 3 5 5 4 The capacity of 4-5-3-4 is 3 2 units around 1-2-4-5-3-1 3 units around 2-4-5-3-2 cycle flows path flows

Update 2 2 4 3 2 3 update the current flow and decomposition 2 1 1 6 3 update the current flow and decomposition 2 1 1 6 -2 4 1 4 3 5 5 1 4 2 units around 1-2-4-5-3-1 3 units around 2-4-5-3-2 3 units around 4-5-3-4 cycle flows path flows

Find the next flow or cycle start with a supply node and find the next flow or cycle. 2 2 4 3 2 2 1 1 6 -2 1 4 The capacity of 1-2-4-6 is 2 3 5 5 1 4 2 units around 1-2-4-5-3-1 3 units around 2-4-5-3-2 3 units around 4-5-3-4 cycle flows path flows

Update update the current flow and decomposition 2 2 4 3 1 2 2 1 1 6 2 2 4 3 1 2 2 1 1 6 -2 1 4 3 5 5 1 4 2 units around 1-2-4-5-3-1 3 units around 2-4-5-3-2 2 units in 1-2-4-6 3 units around 4-5-3-4 cycle flows path flows

Find the next path or cycle start with any node incident to an arc with flow and find the next flow or cycle. 2 4 1 1 6 -2 1 4 3 3 5 5 4 1 2 units around 1-2-4-5-3-1 3 units around 2-4-5-3-2 2 units in 1-2-4-6 3 units around 4-5-3-4 cycle flows path flows

Update 2 4 1 1 6 -2 1 4 3 3 5 5 4 4 1 cycle flows path flows 2 4 1 1 6 -2 1 4 3 3 5 5 4 4 1 2 units around 1-2-4-5-3-1 3 units around 2-4-5-3-2 2 units in 1-2-4-6 3 units around 4-5-3-4 1 units around 3-4-6-5-3 cycle flows path flows

The Final Decomposition 2 4 1 6 -2 4 3 5 4 2 units around 1-2-4-5-3-1 3 units around 2-4-5-3-2 3 units around 4-5-3-4 2 units in 1-2-4-6 1 units around 3-4-6-5-3 4 units around 5-6-5 cycle flows path flows