A combinatorial algorithm for the TDMA message scheduling problem

DOI10.1007/s10589-007-9143-8zbMath1175.90162OpenAlexW2052521546MaRDI QIDQ839680

Panos M. Pardalos, Clayton W. Commander

Publication date: 2 September 2009

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-007-9143-8

zbMATH Keywords

optimizationheuristicsgraph algorithms\(\mathcal{NP}\)-hardTDMA networks

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Boolean programming (90C09)

Related Items (2)

Perfect periodic scheduling for binary tree routing in wireless networks ⋮ Energy efficient spatial TDMA scheduling in wireless networks

Uses Software

• GRASP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Traffic assignment in communication satellites
• A probabilistic heuristic for a computationally difficult set covering problem
• Unit disk graphs
• Sparse graphs usually have exponentially many optimal colorings
• Greedy randomized adaptive search procedures
• Introduction to global optimization
• Time-slot assignment for TDMA-systems
• Wireless mesh networks: a survey
• A combinatorial algorithm for message scheduling on controller area networks
• ON THE PERFORMANCE OF HEURISTICS FOR BROADCAST SCHEDULING
• Link scheduling in polynomial time
• Efficient algorithms for SS/TDMA scheduling
• Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
• A GRASP for coloring sparse graphs

This page was built for publication: A combinatorial algorithm for the TDMA message scheduling problem