n	Linear		SDP MRC		Reduced SDP
n	$\bar{f}$	$\bar{t}$	${\bar{E}}_{f}$	$\bar{t}$	${\bar{E}}_{f}$	$\bar{t}$
2	7.3300e+02	0.02	-1.2258e-01	1.10	0.0000e+00	0.44
3	1.7891e+03	0.05	-2.8128e-01	3.95	0.0000e+00	0.27
4	3.2777e+03	0.15	-3.0212e-02	13.81	8.7450e-03	0.64
5	5.1840e+03	0.29	7.8695e-03	38.74	9.7976e-03	1.47
6	7.7355e+03	0.48	1.1984e-02	113.39	1.6149e-02	3.13
7	1.0212e+04	0.87	3.3375e-02	253.88	3.2369e-02	5.33
8	1.3432e+04	3.16	3.5014e-02	516.90	5.3592e-02	9.33
9	1.6894e+04	5.11	2.8511e-02	1070.48	4.4611e-02	16.47
10	2.0920e+04	7.46	8.2483e-02	2065.31	8.0239e-02	29.03
11	2.5079e+04	13.24	6.5871e-02	3600.69	6.0877e-02	49.06
12	2.8963e+04	17.38	8.8370e-02	5487.36	7.5394e-02	75.73
13	3.4313e+04	25.94	9.5084e-02	8925.42	9.8324e-02	114.65
14	4.0464e+04	91.94	1.3480e-01	13786.32	1.3321e-01	180.81
15	4.5725e+04	97.57	1.1949e-01	21204.91	1.1993e-01	229.93
16	5.3133e+04	172.20	1.3060e-01	34686.28	1.2608e-01	363.37
17	6.0957e+04	674.33	1.1399e-01	46958.26	1.1160e-01	731.70
18	6.6762e+04	1013.89	1.3102e-01	67643.59	1.2555e-01	819.57
19	7.5247e+04	1666.63	1.3078e-01	104376.27	1.3800e-01	1039.97
20	8.0043e+04	1104.60	1.4696e-01	123204.42	1.4079e-01	1459.20

\begin{array}{l} Figure 1: A timetable matrix for n = 2 \\ T = \begin{matrix} 2 & 3 & 2 & 4 & 3 & 4 \\ 1 & 4 & 1 & 3 & 4 & 3 \\ 4 & 1 & 4 & 2 & 1 & 2 \\ 3 & 2 & 3 & 1 & 2 & 1 \end{matrix} \end{array}

\begin{array}{l} Figure 2: An HA-assignment matrix consistent with 𝒯 \\ 𝒜= \begin{matrix} H & H & A & A & A & H \\ A & H & H & H & A & A \\ A & A & H & A & H & H \\ H & A & A & H & H & A \end{matrix} \end{array}

l (t, s) = {\begin{matrix} d (t, t) = 0 \begin{matrix}  \end{matrix} if (a_{t s}, a_{t s + 1}) = (H, H) \\ d (τ (t, s), τ (t, s + 1)) \begin{matrix}  \end{matrix} \begin{matrix}  \end{matrix} if (a_{t s}, a_{t s + 1}) = (A, A) \\ d (t, τ (t, s + 1)) \begin{matrix}  \end{matrix} if (a_{t s}, a_{t s + 1}) = (H, A) \\ d (τ (t, s), t) \begin{matrix}  \end{matrix} if (a_{t s}, a_{t s + 1}) = (A, H) . \end{matrix}

\begin{array}{l} minimize l (x) = \frac{1}{4} \sum_{u, v \in V} w_{u v} (1 - x_{u} x_{v}) \\ subject to \begin{matrix}  \end{matrix} x_{v}^{2} = 1 \begin{matrix}  \end{matrix} \forall v \in V \\ \begin{matrix}  \end{matrix} x_{u} x_{v} = - 1 \begin{matrix}  \end{matrix} \forall {u, v} \in E_{c u t} \\ \begin{matrix}  \end{matrix} x_{r} = 1. \end{array}

\begin{array}{l} minimize \begin{matrix}  \end{matrix} l (X) = 〈 C, X 〉 \\ subject to \begin{matrix}  \end{matrix} X_{v v} = 1 \begin{matrix}  \end{matrix} \forall v \in V \\ \begin{matrix}  \end{matrix} X_{u v} = - 1 \begin{matrix}  \end{matrix} \forall {u, v} \in E_{c u t} \\ \begin{matrix}  \end{matrix} X \underline{≻} 0. \end{array}

\begin{matrix} l (t, s) = d (t', t ") | v_{t s} \cap V' | | v_{t s + 1} \cap V' | + d (t, t ") (1 - | v_{t s} \cap V' |) | v_{t s + 1} \cap V' | \\ + d (t', t) | v_{t s} \cap V' | (1 - | v_{t s + 1} \cap V' |) \end{matrix}

\begin{matrix} | v_{t s} \cap V' | | v_{t s + 1} \cap V' | = \frac{1}{2} (| {r, v_{t s}} \cap δ (V') | + | {r, v_{s + 1}} \cap δ (V') | \\ - | {v_{t s}, v_{s + 1}} \cap δ (V') |) . \end{matrix}

\begin{array}{l} Minimize \begin{matrix}  \end{matrix} l (X) = 〈 C, X 〉 \\ subject to \begin{matrix}  \end{matrix} X_{v v} = 1 \begin{matrix}  \end{matrix} v \in V 1 \\ \begin{matrix}  \end{matrix} X_{v w} = - 1 \begin{matrix}  \end{matrix} \begin{matrix}  \end{matrix} {v, w} \in E 1_{c u t} \\ \begin{matrix}  \end{matrix} X \underline{≻} 0 \end{array}

\begin{array}{l} Figure 3: Labels assigned to each component on the timetable \\ γ = \begin{matrix} [1,1] & [2,1] & [1,2] & [3,1] & [2,2] & [3,2] \\ [1,3] & [4,1] & [1,4] & [5,1] & [4,2] & [5,2] \\ [6,1] & [2,3] & [6,2] & [5,3] & [2,4] & [5,4] \\ [6,3] & [4,3] & [6,4] & [3,3] & [4,4] & [3,4] \end{matrix} \end{array}

\begin{array}{l} X_{(t_{k} s_{k}) (t_{k} s_{k}^{'})} = - 1 \\ X_{(t_{k} s_{k}) (t_{k}^{'} s_{k})} = - 1 \\ X_{(t_{k} s_{k}^{'}) (t_{k}^{'} s_{k}^{'})} = - 1 \\ X_{(t_{k}^{'} s_{k}) (t_{k}^{'} s_{k}^{'})} = - 1, \end{array}

\begin{array}{l} l (t, s) = d (t', t ") y_{t s} y_{t s + 1} + d (t, t ") (1 - y_{t s}) y_{t s + 1} + d (t', t) y_{t s} (1 - y_{t s + 1}) \\ = d (t, t ") y_{t s + 1} + d (t', t) y_{t s} + (d (t', t ") - d (t, t ") - d (t', t)) y_{t s} y_{t s + 1} \end{array}

\begin{array}{l} (2 y_{t_{k} s_{k}} - 1) (2 y_{t_{k} s_{k}^{'}} - 1) = - 1 \\ (2 y_{t_{k} s_{k}} - 1) (2 y_{t_{k}^{'} s_{k}} - 1) = - 1 \\ (2 y_{t_{k} s_{k}^{'}} - 1) (2 y_{t_{k}^{'} s_{k}^{'}} - 1) = - 1 \\ (2 y_{t_{k}^{'} s_{k}} - 1) (2 y_{t_{k}^{'} s_{k}^{'}} - 1) = - 1, \end{array}

\begin{array}{l} y_{t_{k} s_{k}} + y_{t_{k} s_{k}^{'}} - 2 y_{t_{k} s_{k}} y_{t_{k} s_{k}^{'}} = 1 \\ y_{t_{k} s_{k}} + y_{t_{k}^{'} s_{k}} - 2 y_{t_{k} s_{k}} y_{t_{k}^{'} s_{k}} = 1 \\ y_{t_{k} s_{k}^{'}} + y_{t_{k}^{'} s_{k}^{'}} - 2 y_{t_{k} s_{k}^{'}} y_{t_{k}^{'} s_{k}^{'}} = 1 \\ y_{t_{k}^{'} s_{k}} + y_{t_{k}^{'} s_{k}^{'}} - 2 y_{t_{k}^{'} s_{k}} y_{t_{k}^{'} s_{k}^{'}} = 1 \end{array}

\begin{array}{l} minimize l (y) = 〈 (\begin{matrix} a & \frac{1}{2} c^{T} \\ \frac{1}{2} c & \frac{1}{2} Q \end{matrix}), (\begin{matrix} 1 & y^{T} \\ y & y y^{T} \end{matrix}) 〉 \\ subject to 〈 (\begin{matrix} 1 & \frac{1}{2} c_{k j}^{T} \\ \frac{1}{2} c_{k j} & \frac{1}{2} H_{k j} \end{matrix}), (\begin{matrix} 1 & y^{T} \\ y & y y^{T} \end{matrix}) 〉 = 0 \begin{matrix}  \end{matrix} \begin{matrix} k = 1,..., n (2 n - 1); \\ j = 1,2,3,4. \end{matrix} \\ \begin{matrix}  \end{matrix} y \in {0,1}^{2 n (4 n - 2)} . \end{array}

\begin{array}{l} minimize l (y) = 〈 (\begin{matrix} a & \frac{1}{2} c^{T} \\ \frac{1}{2} c & \frac{1}{2} Q \end{matrix}), Y 〉 \\ subject to 〈 (\begin{matrix} 1 & \frac{1}{2} c_{k j}^{T} \\ \frac{1}{2} c_{k j} & \frac{1}{2} H_{k j} \end{matrix}), Y 〉 = 0, \begin{matrix}  \end{matrix} \begin{matrix} k = 1,..., n (2 n - 1); \\ j = 1,2,3,4. \end{matrix} \\ \begin{matrix}  \end{matrix} Y_{(t s) (t s)} - Y_{(11) (t s)} = 0, \begin{matrix} \forall (t, s) \in T \times S \end{matrix} \\ \begin{matrix}  \end{matrix} Y \underline{≻} 0. \end{array}

\begin{array}{l} y_{t_{k} s_{k}} + y_{t_{k}^{'} s_{k}} = 1 \\ y_{t_{k} s_{k}} + y_{t_{k} s_{k}^{'}} = 1 \\ - y_{t_{k} s_{k}} + y_{t_{k}^{'} s_{k}} = 0 \end{array}

[\begin{matrix} y_{t_{k}^{'} s_{k}} \\ y_{t_{k} s_{k}^{'}} \\ y_{t_{k}^{'} s_{k}^{'}} \end{matrix}] = [\begin{matrix} 1 \\ 1 \\ 0 \end{matrix}] - [\begin{matrix} 1 \\ 1 \\ - 1 \end{matrix}] y_{t_{k} s_{k}} = b_{k} - A_{t_{k} s_{k}} y_{t_{k} s_{k}} .

A Reduced Semidefinite Programming Formulation for HA Assignment Problems in Sport Scheduling