Table 3.

Algorithm 1.

Algorithm 1
1:	Initialise${\mathrm{N}}_{\mathrm{BEST}}$ as required, ${\mathrm{S}}_{\mathrm{BEST}}\leftarrow \varnothing$
2:	for ${\mathrm{n}}_{\mathrm{e}}={\mathrm{N}}_{\mathrm{BEST}},{\mathrm{N}}_{\mathrm{BEST}}+1,\dots ,{\mathrm{N}}_{\mathrm{c}}$ do
3:	${\mathrm{S}}_{\mathrm{BEST}}^{\mathrm{MDS}}\triangleq$ {$\mathrm{x}$ | $\mathrm{x}$ are the top ${\mathrm{n}}_{\mathrm{e}}$ combinations in ${\mathrm{S}}_{\mathrm{ALL}}$ with largest MDS}
4:	${\mathrm{S}}_{\mathrm{BEST}}^{\mathrm{ADS}}\triangleq$ {$\mathrm{x}$ | $\mathrm{x}$ are the top ${\mathrm{n}}_{\mathrm{e}}$ combinations in ${\mathrm{S}}_{\mathrm{ALL}}$ with largest ADS}
5:	${\mathrm{S}}_{\mathrm{BEST}}\leftarrow \left({\mathrm{S}}_{\mathrm{BEST}}^{\mathrm{MDS}}\cap {\mathrm{S}}_{\mathrm{BEST}}^{\mathrm{ADS}}\right)\cup {\mathrm{S}}_{\mathrm{BEST}}$
6:	if $∣{\mathrm{S}}_{\mathrm{BEST}}∣\ge {\mathrm{N}}_{\mathrm{BEST}}$
7:	return ${\mathrm{S}}_{\mathrm{BEST}}$
8:	end if
9:	end for