EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 20 / No 4 (1986) RAIRO-Oper. Res., 20 4 (1986) 273-285 References
Free Access
Issue
RAIRO-Oper. Res.
Volume 20, Number 4, 1986
Page(s) 273 - 285
DOI https://doi.org/10.1051/ro/1986200402731
Published online 06 February 2017
  • E. BALAS and P. R. LANDWEER, Traffic Assignment in Communication Satellites, Operations Research Letters, Vol. 2, No. 4, 1983, pp. 141-147. [Zbl: 0526.90065] [Google Scholar]
  • G. BONGIOVANNI, D. COPPERSMITH and C. K. WONG, An Optimum Time Slot Assignment Algorithm for an SS/TDMA System with Variable Number of Transponders, IEEE Transactions on Communications, vol. 29, No. 5, 1981, pp. 721-726. [MR: 613237] [Google Scholar]
  • G. BONGIOVANNI, D. T. TANG and C. K. WONG, A General Multibeam Satellite Switching Algorithm, IEEE Transactions on Communications, vol. 29, No. 7, 1981, pp. 1025-1036. [Google Scholar]
  • E. BRANDT, Optimisation de ressources pour des transmissions par satellites utilisant l'AMRT. Thèse 3e cycle, Université de Paris-Sud, Orsay, 1982. [Google Scholar]
  • R. G. BUSACKER and P. J. GOWEN, A Procedure for Determining a Family of Minimal Cost Network Flow Patterns, O.R.O. Technical Report 15, Johns Hopkins University, 1961. [Google Scholar]
  • P. CAMERINI, F. MAFFIOLI and G. TARTARA, Some Scheduling Algorithms for SS/TDMA Systems, Proc. Vth Internat Conf. on Digital Satellite Comm., 1981, Genoa, Italy. [Google Scholar]
  • G. B. DANTZIG, Linear Programming and Extensions, Princeton University Press, 1963. [MR: 201189] [Zbl: 0997.90504] [Google Scholar]
  • J. EDMONDS and R. M. KARP, Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems, Journal ACM, Vol. 19, No. 2, 1972, pp. 248-264. [Zbl: 0318.90024] [Google Scholar]
  • L. R. FORD and D. R. FULKERSON, Flows in Networks, Princeton University Press, 1962. [MR: 159700] [Zbl: 1216.05047] [Google Scholar]
  • M. GONDRAN and M. MINOUX, Graphes et Algorithmes, Eyrolles, Paris, 1979. English translation J. Wiley & Sons 1984. [MR: 615739] [Zbl: 0497.05023] [Google Scholar]
  • T. GONZALES and S. SAHNI, Open Shop Scheduling to Minimize Finish Time, J. ACM, Vol. 23, 1976, pp. 665-679. [MR: 429089] [Zbl: 0343.68031] [Google Scholar]
  • I. GOPAL and C. K. WONG, Minimizing the number of switchings in an SS/TDMA System, Proceedings Intern. Symp., Satellite and Computer Communications, pp. 27-29, 1983, Versailles, France. [Google Scholar]
  • I. S. GOPAL, Scheduling Algorithms for Multi-Beam Communication Satellites, Ph. D. Dissertation, Columbia University, New York, NY, 1982. [Google Scholar]
  • I. S. GOPAL, G. BONGIOVANNI, M. A. BONUCELLI, D. T. TANG and C. K. WONG, An Optimal Switching Algorithm for Multibeam Satellite Systems with Variable Bandwidth Beams, IEEE Transactions on Communications, Vol. 30, No. 11, 1982, pp. 2475-2481. [Google Scholar]
  • I. S. GOPAL, M. A. BONUCELLI and C. K. WONG, Scheduling in Multibeam Satellites with Interfering Zones, IEEE Transactions on Communications, Vol. 31, No. 8, 1983, pp. 941-951. [Zbl: 0511.68021] [Google Scholar]
  • I. S. GOPAL, D. COPPERSMITH and C. K. WONG, Minimizing Packet Waiting Time in a Multibeam Satellite System, IEEE Transactions on Communications, Vol. 30, No. 2, 1982, pp. 305-316. [Zbl: 0486.90055] [Google Scholar]
  • T. INUKAI, Comments on Analysis of a Switch Matrix for an SS/TDMA System, Proceedings of the IEEE, Vol. 66, No. 12, 1978, pp. 1669-1670. [Google Scholar]
  • T. INUKAI, An Efficient SS/TDMA Time Slot Assignment Algorithm, IEEE Transactions on Communications, Vol. 27, No. 10, 1979, pp. 1449-1455. [MR: 547877] [Google Scholar]
  • Y. ITO, Y. URANO, T. MURATANI and M. YAMAGUCHI, Analysis of a Switch Matrix for an SS/TDMA System, Proceedings of the IEEE, Vol. 65, No. 3, 1977, pp. 411-419. [MR: 434597] [Google Scholar]
  • M. MINOUX, Programmation Mathématique (tomes 1 et 2) Collection Technique et Scientifique des Télécommunications, Dunod, Paris, 1983. English translations J. Wiley & Sons 1986. [MR: 2571910] [Zbl: 0546.90056] [Google Scholar]
  • NATARAJAN and CALO, Time Slot Assignment in a SS/TDMA System with minimum Switchings, Report RC 8342, 7/2/80 IBM Thomas J. Watson Research Center. Yorktown Heights, NY 10598 1980. [Google Scholar]
  • L. VISMARA, Piano di accesso dei messaggi in sistemi SS/TDMA: un metodo di enumerazione implicita per minimizzare il tempo di transmission, Tesi di laurea, Politecnico di Milano, Depto di Elettronica. (Paolo Camerini i Francesco Maffioli Relatori), 1982. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.