Research Article

A Bit-Parallel Tabu Search Algorithm for Finding -Optimal and Minimax-Optimal Supersaturated Designs

Table 30

, , and .

24-4-440000004000-4-4044-4-44400
-4240440000-4-40-4-400-44-4-400400
-40240-400004000000-400000000
44024-400000000040000000000
04-4-424000404-4004-40440-44000
00000240004000000-400000000
00000024000000000000000000
00000002400000000000000000
00004000240000000400000000
0-4400400024-4-400-440-4-404-4400
4-40040000-4240-4-4-44400040000
0000-40000-40240000000000000
0-400000000-40240-40040000000
0-400000000-40024-40040000000
-400440000-4-40-4-4240-44-4-400400
-4000-4000044000024-440000000
0-4-400-400404000-4-4244-4-4-44000
440040000-40044444240040000
4-40040000-40000-40-4024000000
-4-4000000000000-40-4002400000
-4000-400004400000-4400240000
400040000-40000004000024000
44000000040000400000002400
00000000000000000000000240
00000000000000000000000024