DP Mathematics HL Questionbank
Chinese postman problem.
Description
[N/A]Directly related questions
- 18M.3dm.hl.TZ0.1c.iii: Calculate the total weight of the solution.
- 18M.3dm.hl.TZ0.1c.ii: Starting and finishing at B, find a solution to the Chinese postman problem for G.
- 18M.3dm.hl.TZ0.1c.i: State the Chinese postman problem.
- 17N.3dm.hl.TZ0.1c: By first removing library C, use the deleted vertex algorithm, to find a lower bound for...
- 17N.3dm.hl.TZ0.1b: Starting at library D use the nearest-neighbour algorithm, to find an upper bound for Mathilde’s...
- 17N.3dm.hl.TZ0.1a: Draw the weighted graph \(H\).
- 12N.3dm.hl.TZ0.1c: The graph above is now to be considered with the edges representing roads in a town and with the...
- 08M.3dm.hl.TZ2.2a: The table below shows the distances between towns A, B, C, D and E. (i) Draw the...
- 15M.3dm.hl.TZ0.1b: Consider the following weighted graph. (i) Write down a solution to the Chinese postman...
- 14N.3dm.hl.TZ0.3b: For the remainder of the question you may find the cheapest route between any two towns by...
