An integer programming approach to the time slot assignment problem in SS/TDMA systems with intersatellite links
暂无分享,去创建一个
[1] Carlos A. Pomalaza-Raez. A note on efficient SS/TDMA assignment algorithms , 1988, IEEE Trans. Commun..
[2] G. Bongiovanni,et al. An Optimum Time Slot Assignment Algorithm for an SS/TDMA System with Variable Number of Transponders , 1981, IEEE Trans. Commun..
[3] Aura Ganz,et al. Efficient algorithms for SS/TDMA scheduling , 1992, IEEE Trans. Commun..
[4] J. A. Bondy,et al. Graph Theory with Applications , 1978 .
[5] R. Gomory,et al. A Linear Programming Approach to the Cutting-Stock Problem , 1961 .
[6] Y. Ito,et al. Analysis of a switch matrix for an SS/TDMA system , 1977, Proceedings of the IEEE.
[7] Sehun Kim,et al. Time slot assignment in a heterogeneous environment of a SS/TDMA system , 1997 .
[8] Harold N. Gabow,et al. Algorithms for Edge Coloring Bipartite Graphs and Multigraphs , 1982, SIAM J. Comput..
[9] Alan A. Bertossi,et al. Time Slot Assignment in SS/TDMA Systems with Intersatellite Links , 1987, IEEE Trans. Commun..
[10] Sehun Kim,et al. An efficient algorithm for generalized SS/TDMA scheduling with satellite cluster , 1994 .
[11] Sungsoo Park,et al. A polyhedral approach to edge coloring , 1991, Oper. Res. Lett..
[12] Martin W. P. Savelsbergh,et al. A Branch-and-Price Algorithm for the Generalized Assignment Problem , 1997, Oper. Res..
[13] Aura Ganz,et al. SS/TDMA scheduling for satellite clusters , 1992, IEEE Trans. Commun..