Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment

References

• Balas E., Landweer P.R. Traffic Assignment in Communication Satellites. Operations Research Letters (1983) 2:141–147Crossref, Google Scholar
• Bongiovanni G., Coppersmith D., Wong C.K. An Optimum Time Slot Assignment Algorithm for an SS/TDMA System with Variable Number of Transponders. IEEE Transactions on Communications COMM-29 (1981) 721–726Crossref, Google Scholar
• Camerini P.M., Maffioli F., Tartara G. Some Scheduling Algorithms for SS/TDMA Systems. Proceedings of the 5th International Conference on Digital Satellite Communication (1981) 405–409Google Scholar
• Dell'Amico M., Maffioli F., Trubian M. New Bounds for Optimum Traffic Assignment in Satellite Communication. (1997) (Dipartimento di Elettronica e Informazione, Milano, Italy) . Rapporto Interno 20.97, Politecnico di MilanoGoogle Scholar
• Dill G.D. TDMA, the State-of-the-Art. Records of the IEEE Electronic and Aerospatial Systems Conference (1977) 315A-31.5HGoogle Scholar
• Feo T.A., Resende M.G. Greedy Randomized Adaptive Search Procedures. Journal of Global Optimization (1995) 6:109–133Crossref, Google Scholar
• Ganz A., Gao Y. Efficient Algorithms for SS/TDMA Scheduling. IEEE Transactions on Communications (1992) 40:1367–1374Crossref, Google Scholar
• Gopal I.S.Scheduling Algorithms for Multi-Beam Communication Satellites (1982) (New York). Ph.D. Dissertation, Columbia UniversityGoogle Scholar
• Gopal I.S., Wong C.K. Minimizing the Number of Switchings in an SS/TDMA System. IEEE Transactions on Communications COMM-33 (1985) 497–501Crossref, Google Scholar
• Inukai T. Analysis of a Switch Matrix for an SS/TDMA System. Proceedings of the IEEE66:1669–1670Comments onCrossref, Google Scholar
• Inukai T. An Efficient SS/TDMA Time-Slot Assignment Algorithm. IEEE Transactions on Communications (1979) 27:1449–1455Crossref, Google Scholar
• Ito Y., Urano Y., Muratani T., Yamaguchi M. Analysis of a Switch Matrix for an SS/TDMA System. Proceedings of the IEEE (1977) 65:411–419Crossref, Google Scholar
• Maffioli F. Personal communication. (1977) Google Scholar
• Minoux M. Optimal Traffic Assignment in an SS/TDMA Frame: A New Approach by Set Covering and Column Generation. RAIRO Recherche Opérationnelle (1986) 20:1–13Google Scholar
• Pomalaza-Raez C.A. A Note on Efficient SS/TDMA Assignment Algorithms. IEEE Transactions on Communications (1988) 36:1078–1082Crossref, Google Scholar
• Rendl F. On the Complexity of Decomposing Matrices Arising in Satellite Communications. Operations Research Letters (1985) 4:5–8Crossref, Google Scholar
• Rendl F. Personal communication. (1986) Google Scholar
• Resende M.G., Ribeiro C.C. A GRASP for Graph Planarization. Networks (1997) 29:173–189Crossref, Google Scholar
• Ribeiro C.C., Minoux M., Penna M.C. An Optimal Column-Generation-with-Ranking Algorithm for Very Large Scale Set Partitioning Problems in Traffic Assignment. European Journal of Operational Research (1989) 41:232–239Crossref, Google Scholar