DocumentCode
1858217
Title
All optimal solutions in STDMA Scheduling
Author
Quintas, Diogo ; Friderikos, Vasilis
Author_Institution
Centre for Telecommun. Res., King´´s Coll. London, London, UK
fYear
2012
fDate
27-31 Aug. 2012
Firstpage
834
Lastpage
838
Abstract
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.
Keywords
integer programming; radio networks; scheduling; time division multiple access; STDMA scheduling problem; cut generation procedure; mixed integer programming; optimal scheduling; small network; Interference; Linear programming; Optimal scheduling; Robustness; Schedules; Signal to noise ratio; Throughput; all optima; mixed integer programming; physical interference; scheduling;
fLanguage
English
Publisher
ieee
Conference_Titel
Signal Processing Conference (EUSIPCO), 2012 Proceedings of the 20th European
Conference_Location
Bucharest
ISSN
2219-5491
Print_ISBN
978-1-4673-1068-0
Type
conf
Filename
6334333
Link To Document