A combinatorial algorithm for the TDMA message scheduling problem

Clayton Commander () and Panos Pardalos ()

Computational Optimization and Applications, 2009, vol. 43, issue 3, 449-463

Keywords: TDMA networks; Heuristics; Graph algorithms; Optimization; $\mathcal{NP}$ -hard (search for similar items in EconPapers)
Date: 2009
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s10589-007-9143-8 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:43:y:2009:i:3:p:449-463

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-007-9143-8

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().