A Decomposition Heuristic for the Maximal Covering Location Problem

Table 3

Computation times for TSPLIB PCB3038 instance, 𝑈=400.

					𝑘=5				𝑘=10
n	p	Optimal	GapLP	CPU	Cuts	Gap	CPUSeq	CPUPar	Cuts	Gap	CPUSeq	CPUPar
3038	17	125320	0.368	802.390	165579	0.205	843.838	235.541	291363	0.470	582.528	223.245
	18	130004	0.517	10265.016		0.372	817.076	283.400		0.712	634.402	243.747
	19	134262∗	0.605	20000.049		0.382	1483.237	598.653		0.793	576.821	222.087
	20	139028∗	0.698	20000.156		0.500	1712.078	798.911		0.973	628.288	236.767
	21	141279∗	0.853	20000.094		0.654	3117.174	1448.730		1.128	646.765	243.302
	22	143809∗	1.196	20000.123		0.992	6656.267	3094.410		1.598	615.783	231.525