Exploring Further Advantages in an Alternative Formulation for the Set Covering Problem

Table 2

Beasley’s OR library description.

Instance set	Number of instances	m	n	Cost range	Density (%)	Optimal solution
4	10	200	1,000	[1, 100]	2.00	Known
5	10	200	2,000	[1, 100]	2.00	Known
6	5	200	1,000	[1, 100]	5.00	Known
a	5	300	3,000	[1, 100]	2.00	Known
b	5	300	3,000	[1, 100]	5.00	Known
c	5	400	4,000	[1, 100]	2.00	Known
d	5	400	4,000	[1, 100]	5.00	Known
nre	5	500	5,000	[1, 100]	10.00	Known
nrf	5	500	5,000	[1, 100]	20.00	Known
nrg	5	1000	10,000	[1, 100]	2.00	Unknown
nrh	5	1000	10,000	[1, 100]	5.00	Unknown