For the network shown in Figure 5.41, solve the vertex 2-center problem. Clearly show the results of each iteration of the algorithm including the lower and upper bounds on the implied coverage distance, the coverage distance used in solving each of the set covering problems, and the number of facilities needed to cover all nodes within that distance.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here