netmax3 - a arc Traff {(i,j) in ROADS} >= 0,...

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

View Full Document Right Arrow Icon
set INTER; # intersections s param entr symbolic in INTER; # entrance to road network param exit symbolic in INTER, <> entr; # exit from road network p set ROADS within (INTER diff {exit}) cross (INTER diff {entr}); s param cap {ROADS} >= 0; # capacities of roads p node Intersection {k in INTER}; n arc Traff_In >= 0, to Intersection[entr]; arc Traff_Out >= 0, from Intersection[exit];
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: a arc Traff {(i,j) in ROADS} &gt;= 0, &lt;= cap[i,j], from Intersection[i], to Intersection[j]; maximize Entering_Traff: Traff_In; m data; d set INTER := a b c d e f g ; s param entr := a ; param exit := g ; p param: ROADS: cap := a b 50, a c 100 b d 40, b e 20 c d 60, c f 20 d e 50, d f 60 e g 70, f g 70 ; f...
View Full Document

This note was uploaded on 04/01/2011 for the course CO 370 taught by Professor Henry during the Winter '11 term at Waterloo.

Ask a homework question - tutors are online