Groups	Xiaochun Heping	Bala Ravi	Bala Ravi II	Nely	Nishant	Jianhua Henry
TEST1_10_80_0	58	46	58	46	46	57
TEST1_20_90_0	91	80	81	77	78	91
TEST1_30_60_0	259	245	281	219	238	267
TEST1_40_70_0	644	587	663	587	613	668
TEST1_50_90_0	671	650	636	640	631	674
TEST1_60_80_0	781	783	803	769	776	855
TEST1_70_70_0	1814	1710	1782	1699	1779	1898
TEST1_80_40_0	1001	809	991	811	935	953
TEST1_90_50_0	1953	1709	1839	1708	1763	1823
TEST1_100_60_0	9030	7762	8280	7707	8298	8883
TEST1_1000_40_0	528087		516483	506149		529733

• I higlighted the current leaders. But keep in mind that the feasibility of these solutions are not yet verified.
• Timings of these results are mostly under a few seconds (except the first algorithm of Bala and Ravi takes over a minute for more than half the data sets).