An Approximation Algorithm for the Facility Location Problem with Lexicographic Minimax Objective
Figure 4
The number of nodes processed by the branch-and-bound method and the number of simplex iterations needed to process the root node as a function of the iteration step . The results were obtained for the benchmark in (a) and in (b) .
