This preview shows page 1. Sign up to view the full content.
Unformatted text preview: for persons W, X, Y and Z to travel to places A,
B, C en D. The objective is to send each person to one of the four places such that
all places will be visited, whilst the total costs are as small as possible. Translate
this problem into a maximum ﬂow problem and solve it with the maximum ﬂow
algorithm.
ABCD
W 16 12 11 12
X 13 11 8 14
Y 10 6 7 9
Z 11 15 10 8
3. Given the digraph below with source r and sink s. The two values between brackets
given at each arc give the demand and the capacity of that arc. Find a feasible ﬂow
by use of the method presented in the course and increase this ﬂow to a maximum
ﬂow. Determine also the...
View
Full
Document
This document was uploaded on 03/11/2014 for the course EOR Combinator at Tilburg University.
 Fall '14

Click to edit the document details