The table below give the expenses for persons w x y

Info iconThis preview shows page 1. Sign up to view the full content.

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

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 flow problem and solve it with the maximum flow 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 flow by use of the method presented in the course and increase this flow to a maximum flow. Determine also the...
View Full Document

This document was uploaded on 03/11/2014 for the course EOR Combinator at Tilburg University.

Ask a homework question - tutors are online