Table 5.

Numerical results—explanation.

Notation	Description
$T^{LR}$	optimal frame size obtained from the linear relaxation of the problem after the c-sets generation process
$T^{MIP}$	optimal frame size obtained from frame size minimization
$\left|\mathcal{C}\right|$	number of generated c-sets
$t^{MP}$	total computation time of solving master problem during c-sets generation process
$t^{PP}$	total computation time of solving pricing problem during c-sets generation process
$t^{MIP}$	computation time of solving the final MIP version of the problem