Heuristics for Synthesizing Robust Networks with a Diameter Constraint
Figure 4
A network with all possible edges connecting 8 nodes including edge weights is shown in (a). (b) represents the initial feasible solution which is a star graph. (c) represents an optimal network which also happens to be the solution found by the 2-opt, 3-opt, and tabu search methods.
