This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: ID: Page 2 of 82 1 221 42 11 1 c a b s d e f Problem 1: [10 marks] Using Dantzig’s Algorithm, either find a tree of shortest dipaths rooted at s , or find a negative dicycle in the digraph above. (Start with the spanning tree indicated by the edges in bold.) ID: Page 3 of 8 Problem 2: [10 marks] A company sends its products via courier to its clients. For the next n days, the number of orders on the ith day is d i . The cost of shipping d parcels in a day is p ( d ). Naturally p ( d + d ′ ) ≤ p ( d ) + p ( d ′ ). Thus it may be more ecconomical to delay sending out orders on one or more days to take advantage of the bulk postage rates. However, the company pays a penalty of c ( i ) for each parcel that is idays late. On which of the next n days should the company ship its parcels in order to minimize its costs (mailing plus penalties)? Formulate this problem as a shortest ( s, t )dipath problem. ID: Page 4 of 8 Problem 3: [10 marks] Let D = ( N, A ) be a digraph with arclengths (...
View
Full
Document
This note was uploaded on 11/18/2010 for the course CO 351 taught by Professor Various during the Fall '05 term at Waterloo.
 Fall '05
 various

Click to edit the document details