Journals
Publish with us
Publishing partnerships
About us
Blog
Computational and Mathematical Methods
Journal overview
For authors
For reviewers
For editors
Table of Contents
Special Issues
Computational and Mathematical Methods
/
2023
/
Article
/
Tab 31
/
Research Article
A Bit-Parallel Tabu Search Algorithm for Finding
-
Optimal and Minimax-Optimal Supersaturated Designs
Table 31
-
optimal and minimax-optimal SSDs obtained by the TS algorithm.
nRUNs
CPU time
16
25
95,989
211.5 minutes
26
190,049
1.1 days
27
3,954,798
24.4 days
18
23
1,232
3.5 minutes
24
880,559
2.7 days
25
40,058
241.6 minutes
26
12,516
74.2 minutes
27
26,689
174 minutes
28
14,243
96.9 minutes
29
392,285
3.1 days
20
21
19
0.1 minutes
22
22
6
0.05 minutes
23
7
1.0 minutes
24
24
509
4.0 minutes
25
112,976
1.6 days