Optimal traffic assignment in a SS/TDMA frame : a new approach by set covering and column generation
RAIRO - Operations Research - Recherche Opérationnelle, Volume 20 (1986) no. 4, pp. 273-285.
@article{RO_1986__20_4_273_0,
     author = {Minoux, M.},
     title = {Optimal traffic assignment in a {SS/TDMA} frame : a new approach by set covering and column generation},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {273--285},
     publisher = {EDP-Sciences},
     volume = {20},
     number = {4},
     year = {1986},
     zbl = {0608.90076},
     language = {en},
     url = {http://archive.numdam.org/item/RO_1986__20_4_273_0/}
}
TY  - JOUR
AU  - Minoux, M.
TI  - Optimal traffic assignment in a SS/TDMA frame : a new approach by set covering and column generation
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 1986
SP  - 273
EP  - 285
VL  - 20
IS  - 4
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/RO_1986__20_4_273_0/
LA  - en
ID  - RO_1986__20_4_273_0
ER  - 
%0 Journal Article
%A Minoux, M.
%T Optimal traffic assignment in a SS/TDMA frame : a new approach by set covering and column generation
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 1986
%P 273-285
%V 20
%N 4
%I EDP-Sciences
%U http://archive.numdam.org/item/RO_1986__20_4_273_0/
%G en
%F RO_1986__20_4_273_0
Minoux, M. Optimal traffic assignment in a SS/TDMA frame : a new approach by set covering and column generation. RAIRO - Operations Research - Recherche Opérationnelle, Volume 20 (1986) no. 4, pp. 273-285. http://archive.numdam.org/item/RO_1986__20_4_273_0/

E. Balas and P. R. Landweer, Traffic Assignment in Communication Satellites, Operations Research Letters, Vol. 2, No. 4, 1983, pp. 141-147. | Zbl

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

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.

E. Brandt, Optimisation de ressources pour des transmissions par satellites utilisant l'AMRT. Thèse 3e cycle, Université de Paris-Sud, Orsay, 1982.

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.

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.

G. B. Dantzig, Linear Programming and Extensions, Princeton University Press, 1963. | MR | Zbl

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

L. R. Ford and D. R. Fulkerson, Flows in Networks, Princeton University Press, 1962. | MR

M. Gondran and M. Minoux, Graphes et Algorithmes, Eyrolles, Paris, 1979. English translation J. Wiley & Sons 1984. | MR | Zbl

T. Gonzales and S. Sahni, Open Shop Scheduling to Minimize Finish Time, J. ACM, Vol. 23, 1976, pp. 665-679. | MR | Zbl

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.

I. S. Gopal, Scheduling Algorithms for Multi-Beam Communication Satellites, Ph. D. Dissertation, Columbia University, New York, NY, 1982.

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.

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

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

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.

T. Inukai, An Efficient SS/TDMA Time Slot Assignment Algorithm, IEEE Transactions on Communications, Vol. 27, No. 10, 1979, pp. 1449-1455. | MR

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

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 | Zbl

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.

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.