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

INFORMS Journal on Computing

Volumn 12, Issue 3, 2000, Pages 164-176

  Paris, Marcelo ^a   Ribeiro, Celso C ^a  

^a PONTIFICAL CATHOLIC UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

GRASP; Local search; Matrix decomposition; Reactive GRASP; TDMA; Traffic assignment

Indexed keywords

EID: 0013132075     PISSN: 10919856     EISSN: None     Source Type: Journal    
DOI: 10.1287/ijoc.12.3.164.12639     Document Type: Article

References (19)

1. E. BALAS and P.R. LANDWEER, 1983. Traffic Assignment in Communication Satellites, Operations Research Letters 2, 141-147.
2. G. BONGIOVANNI, D. COPPERSMITH, and C.K. WONG, 1981. An Optimum Time Slot Assignment Algorithm for an SS/TDMA System with Variable Number of Transponders, IEEE Transactions on Communications COMM-29, 721-726.
3. P.M. CAMERINI, F. MAFFIOLI, and G. TARTARA, 1981. Some Scheduling Algorithms for SS/TDMA Systems, Proceedings of the 5th International Conference on Digital Satellite Communication, 405-409.
4. M. DELL'AMICO, F. MAFFIOLI, and M. TRUBIAN, 1997. New Bounds for Optimum Traffic Assignment in Satellite Communication, Rapporto Interno 20.97, Politecnico di Milano, Dipartimento di Elettronica e Informazione, Milano, Italy.
5. G.D. DILL, 1977. TDMA, the State-of-the-Art, Records of the IEEE Electronic and Aerospatial Systems Conference, 31.5A-31.5H.
6. T.A. FEO and M.G. RESENDE, 1995. Greedy Randomized Adaptive Search Procedures, Journal of Global Optimization 6, 109-133.
7. A. GANZ and Y. GAO, 1992. Efficient Algorithms for SS/TDMA Scheduling, IEEE Transactions on Communications 40, 1367-1374.
8. I.S. GOPAL, 1982. Scheduling Algorithms for Multi-Beam Communication Satellites, Ph.D. Dissertation, Columbia University, New York.
9. I.S. GOPAL and C.K. WONG, 1985. Minimizing the Number of Switchings in an SS/TDMA System, IEEE Transactions on Communications COMM-33, 497-501.
10. T. INUKAI, 1978. Comments on "Analysis of a Switch Matrix for an SS/TDMA System," Proceedings of the IEEE 66, 1669-1670.
11. T. INUKAI, 1979. An Efficient SS/TDMA Time-Slot Assignment Algorithm, IEEE Transactions on Communications 27, 1449-1455.
12. Y. ITO, Y. URANO, T. MURATANI, and M. YAMAGUCHI, 1977. Analysis of a Switch Matrix for an SS/TDMA System, Proceedings of the IEEE 65, 411-419.
13. F. MAFFIOLI, 1977. Personal communication.
14. M. MINOUX, 1986. Optimal Traffic Assignment in an SS/TDMA Frame: A New Approach by Set Covering and Column Generation, RAIRO Recherche Opérationnelle 20, 1-13.
15. C.A. POMALAZA-RAEZ, 1988. A Note on Efficient SS/TDMA Assignment Algorithms, IEEE Transactions on Communications 36, 1078-1082.
16. F. RENDL, 1985. On the Complexity of Decomposing Matrices Arising in Satellite Communications, Operations Research Letters 4, 5-8.
17. F. RENDL, 1986. Personal communication.
18. M.G. RESENDE and C.C. RIBEIRO, 1997. A GRASP for Graph Planarization, Networks 29, 173-189.
19. C.C. RIBEIRO, M. MINOUX, and M.C. PENNA, 1989. An Optimal Column-Generation-with-Ranking Algorithm for Very Large Scale Set Partitioning Problems in Traffic Assignment, European Journal of Operational Research 41, 232-239.