- +1-530-264-8006
- info@tutorsglobe.com

18,76,764

Questions

Asked

21,311

Experts

9,67,568

Questions

Answered

Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!

Submit Assignment2015 © Tutors Globe. All rights reserved.

## Maximal Flow Problem Algorithms, Sample Assignment

Maximal Flow ProblemAlgorithmStep1Determine a path from source to sink that can hold a positive flow of material. If no such path exists then go to step 5

Step2

Find out the highest flow that can be shipped from this path and indicate by 'k' units.

Step3

Reduce the direct capacity of each branch of this path 'k' and amplify the reverse capacity k

_{1}. Add 'k' units to the amount distributed to sink.Step4

Go on step1

Step5

The maximal flow is the quantity of material delivered to the sink. The optimal shipping schedule is recognized through comparing the original network with the final network. Any deduction in capacity indicates shipment.

Sample AssignmentTake the following network and find the amount of flow among the networks.

AnswerIteration 1: 1 - 3 - 5Iteration 2: 1 - 2 - 3 - 4 - 5

Iteration 3: 1 - 4 - 5Iteration 4: 1 - 2 - 5Iteration 5: 1 - 3 - 2 - 5Maximum flow = 60 units. Thus the network can be written as

www.tutorsglobe.com - Maximal Flow Problem Assignment Help, Maximal Flow Problem Homework Help, Maximal Flow Problem Assignment Tutors, Maximal Flow Problem Solutions, Maximal Flow Problem Answers, Operation Research Assignment Tutors