A Decomposition Heuristic for the Maximal Covering Location Problem

Table 2

Computation times for SJC instances, 𝑈=200.

					𝑘=10				𝑘=50
n	p	Optimal	GapLP	CPU	Cuts	Gap	CPUSeq	CPUPar	Cuts	Gap	CPUSeq	CPUPar
324	20	9670	0.334	0.172	980	0.243	19.293	19.293	3008	0.347	32.943	32.911
	30	11737	0.087	0.484		0.060	28.943	28.943		0.094	69.959	69.959
	40	12151	0.005	0.094		0.008	31.066	31.066		0.138	77.872	77.612
	50	12152	0.000	0.015		0.000	9.926	9.926		0.000	61.456	61.395
	60	12152	0.000	0.047		0.000	4.575	4.575		0.000	14.376	14.376
	80	12152	0.000	0.016		0.000	3.670	3.670		0.000	33.936	33.936
	108	12152	0.000	0.031		0.248	11.343	11.343		0.001	897.830	893.405
500	40	17077	0.453	0.203	657	0.387	24.668	20.669	2625	0.469	55.001	51.048
	50	18361	0.014	0.109		0.003	39.109	32.248		0.025	67.626	62.596
	60	19153	0.035	0.063		0.005	52.639	35.363		0.112	85.374	76.578
	70	19551	0.110	1.078		0.069	43.946	29.817		0.170	76.671	68.721
	80	19703	0.013	0.156		0.008	35.495	27.927		0.150	102.056	95.253
	100	19707	0.000	0.078		0.000	16.624	16.501		0.001	89.858	86.698
	130	19707	0.000	0.047		0.000	1.986	1.864		0.001	26.546	25.809
	167	19707	0.000	0.016		0.016	22.379	22.225		0.859	22.314	22.133
818	80	27945	0.070	0.203	840	0.069	57.835	27.423	4910	0.121	147.155	115.605
	90	28519	0.138	1.141		0.071	114.145	45.536		0.177	128.574	99.585
	100	28910	0.103	1.391		0.036	88.885	33.153		0.175	101.875	80.758
	120	29165	0.002	1.234		0.002	55.710	31.180		0.117	141.246	115.434
	140	29168	0.000	0.125		0.000	11.643	8.940		0.021	171.961	143.737
	160	29168	0.000	0.062		0.000	9.738	7.598		0.878	39.343	36.244
	200	29168	0.000	0.032		0.000	5.762	4.610		0.847	37.205	34.871
	273	29168	0.000	0.031		0.207	24.698	18.505		2.904	25.282	23.772