A Decomposition Heuristic for the Maximal Covering Location Problem

<table class="table-group" width="800px"><tr class="fig-image" id="a"><td><img alt="120756.fig.003a" src="https://static.hindawi.com/articles/aor/volume-2010/120756/figures/120756.fig.003a.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(a) </b>A possible partition</td></tr></table></td></tr><tr class="fig-image" id="b"><td><img alt="120756.fig.003b" src="https://static.hindawi.com/articles/aor/volume-2010/120756/figures/120756.fig.003b.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(b) </b>The corresponding subgraphs</td></tr></table></td></tr></table>

<table>Partitioning a covering graph.</table>

Advances in Operations Research

fig3

Figure 3

Figure 3: A Decomposition Heuristic for the Maximal Covering Location Problem 