An integer programming approach to the time slot assignment problem in SS/TDMA systems with intersatellite links
We consider the time slot assignment problem (TSAP) in a cluster of satellite-switched time-division multiple-access (SS/TDMA) satellite system with intersatellite links (ISL). The problem is known to be NP-complete. In this paper, we consider TSAP as a graph coloring problem on a bipartite multigraph which is constructed from the traffic requirements. We give an integer programming (IP) model for TSAP and propose an algorithm based on the column generation technique. Computational results using randomly generated data are reported. (C) 2001 Elsevier Science BY. All rights reserved.
- Publisher
- ELSEVIER SCIENCE BV
- Issue Date
- 2001-11
- Language
- English
- Article Type
- Article
- Keywords
ALGORITHMS
- Citation
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, v.135, no.1, pp.57 - 66
- ISSN
- 0377-2217
- Appears in Collection
- IE-Journal Papers(저널논문)
- Files in This Item
This item is cited by other documents in WoS
| ⊙ Detail Information in WoSⓡ | Click to see |  |
| ⊙ Cited 5 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.