# MCLDP Testing Data

## Description

(1) Test results for two variants each of two heuristic solution methods (i.e., an iterative bounding heuristic (IBH) and a reformulation-based construction heuristic (RCH) on 1080 MCLDP instances for m=90,120,150 and varying parameters for (n,p,q,r), with comparison to a time-limited enumerative approach of the upper-level feasible region. (2) Test results for a sensitivity analysis on a user-defined solution method parameter (i.e., delta) over four settings (i.e., 25, 50, 75, 100), for 1080 MCLDP instances at each setting, solved using two variants each of two heuristic solution methods. (3) Test results for two variants each of two heuristic solution methods (i.e., an iterative bounding heuristic (IBH) and a reformulation-based construction heuristic (RCH) on 1080 MCLDP instances for m=400,600,800 and varying parameters for (n,p,q,r). (4) Test results for the two superlative heuristics for m=800 and higher r-values to evaluate the consistency of an observed phenomenon in previous testing results.

## Files

## Steps to reproduce

Implemented the four heuristics as described in Section 4 of the manuscript entitled, "The Maximal Covering Location Disruption Problem", with instance generation as described in Section 5.1.