Consider the network shown in Figure 4.27. Link distances are shown beside the links and the demands are shown in boxes beside each node. (a) Use the greedy adding algorithm to solve the maximum...

Consider the network shown in Figure 4.27. Link distances are shown beside the links and the demands are shown in boxes beside each node.

(a) Use the greedy adding algorithm to solve the maximum covering problem for this network with a coverage distance of 34 and a single facility. Assume you can only locate on the nodes of the network. In particular, where do you locate? How many demands are covered? Which nodes are covered and which are not?

(b) For a coverage distance of 34 use the greedy adding algorithm (without substitution) for the maximum covering problem to complete the following table:

1. You may want to set up a table showing how much demand each candidate location covers.

2. Remember that even once a demand node is covered it may still be considered as a candidate facility site.

3. You may not need all rows of the table.