Solving the Set Packing Problem via a Maximum Weighted Independent Set Heuristic

Table 4

Results of algorithms DLSNOCC, DLSECC, and DLSWCC on instances with 2000 variables.

Instance	Characteristics					DLSNOCC		DLSECC		DLSWCC_STATIC		DLSWCC
	Var	Cnst	Density (%)	M_one	Weight	Best	Avrg	Best	Avrg	Best	Avrg	Best	Avrg
pb2000rand1	2000	10000	2.54	100	[1-20]	40	40.00	40	40.00	40	40.00	40	40
pb2000rand2	2000	10000	2.55	100	[1-1]	2	2.00	2	2.00	2	2.00	2	2
pb2000rand3	2000	10000	0.55	20	[1-20]	478	469.56	478	476.31	475	451.88	478	477.06
pb2000rand4	2000	10000	0.55	20	[1-1]	32	31.75	32	31.81	32	30.94	32	31.88
pb2000rand5	2000	2000	2.55	100	[1-20]	140	140.00	140	140.00	140	140.00	140	140
pb2000rand6	2000	2000	2.56	100	[1-1]	9	9.00	9	9.00	9	9.00	9	9
pb2000rand7	2000	2000	0.56	20	[1-20]	1800	1786.44	1811	1810.75	1769	1713.31	1811	1810.88
pb2000rand8	2000	2000	0.56	20	[1-1]	135	133.25	135	134.19	133	131.06	135	134.13
Avrg						329.50	326.50	330.88	330.51	325.00	314.77	330.88	330.62