Algorithm 1. Radar allocation method

Step (1): Working out the problem in (47) $Q\cdot \frac{N!}{\left(N-2\right)!2!}$ times, then we can get the minimum dwell time matrix $S_{k,\min }$ in the constraint of ${\displaystyle \sum _{i=1}^N{u}_{i,k}^q}=2$. Step (2): Sort the columns of matrix $S_{k,\min }$ in ascending order and assign the target corresponding to the smallest element in the first row to the corresponding radar combination. Step (3): Remove the column vectors corresponding to the target assigned in Step (2). Remove all the row vectors of the radar which is contained in the radar combination assigned in Step (2). Step (4): Repeat Step (2) and Step (3) until all the targets are assigned in order to obtain the optimal allocation matrix $U_{k,\mathrm{opt}}$.