All optimal solutions in STDMA Scheduling

In this paper we review different Mixed Integer Programming formulations of the STDMA Scheduling problem and introduce a novel formulation. It is shown that the problem admits, in general, multiple optimal solutions - we propose an efficient cut generation procedure to construct all optimal schedules and investigate the properties of optimal schedules in two small networks.