A Polynomial Time Optimal Algorithm for Satellite-Switched Time-Division Multiple Access Satellite Communications with General Switching Modes

DOI10.1137/0404003zbMATH Open0713.90068OpenAlexW2039459522MaRDI QIDQ3199199FDOQ3199199

Authors: Maurizio A. Bonuccelli 

Publication date: 1991

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0404003

Recommendations

• Optimization-based scheduling for the single-satellite, multi-ground station communication problem
• New bounds for optimum traffic assignment in satellite communication.
• A heuristic for decomposing traffic matrices in TDMA satellite communication
• Quasi-optimal resource allocation in multispot MFTDMA satellite networks
• An integer programming approach to the time slot assignment problem in SS/TDMA systems with intersatellite links
• A note on scheduling problems arising in satellite communications
• SS/TDMA Satellite Communications withk-Permutation Switching Modes
• On the complexity of decomposing matrices arising in satellite communication
• Multi-objective approaches to ground station scheduling for optimization of communication with satellites

zbMATH Keywords

Birkhoff-von Neumann Theorempolynomial time optimal algorithmwideband communication satellites

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Deterministic network models in operations research (90B10) Case-oriented studies in operations research (90B90) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60)

Cited In (5)

• Efficient time slot assignment algorithms for TDM hierarchical and nonhierarchical switching systems
• SS/TDMA Satellite Communications withk-Permutation Switching Modes
• A heuristic for decomposing traffic matrices in TDMA satellite communication
• A branch and price algorithm for the SS/TDMA problem with cardinality constraint
• A note on SS/TDMA satellite communication

This page was built for publication: A Polynomial Time Optimal Algorithm for Satellite-Switched Time-Division Multiple Access Satellite Communications with General Switching Modes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3199199)