Time-slot assignment for TDMA-systems

DOI10.1007/BF02260498zbMath0559.90056MaRDI QIDQ2265947

Rainer E. Burkard

Publication date: 1985

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

communicationcomputational complexityassignmentmatrix decompositionweighted sum of permutation matricesmax flow min cost network flow problemTDMA-technique (time division multiple access) optimal decompositiontime-slot assignment

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Deterministic network models in operations research (90B10)

Related Items (16)

Comment on ``The facility layout problem ⋮ The facility layout problem ⋮ A combinatorial algorithm for the TDMA message scheduling problem ⋮ A heuristic for decomposing traffic matrices in TDMA satellite communication ⋮ Time slot scheduling of compatible jobs ⋮ An algorithm for quadratic assignment problems ⋮ Partitioning the edge set of a bipartite graph into chain packings: Complexity of some variations ⋮ A note on SS/TDMA satellite communication ⋮ Single and multiple period layout models for automated manufacturing systems ⋮ Constrained partitioning problems ⋮ Random assignment problems ⋮ Simulated annealing for machine layout problems in the presence of zoning constraints ⋮ Selected topics on assignment problems ⋮ Integer quadratic optimization ⋮ An exact algorithm for the general quadratic assignment problem ⋮ Pyramidal tours and the traveling salesman problem

Cites Work

• Unnamed Item
• Unnamed Item
• Traffic assignment in communication satellites
• On the complexity of decomposing matrices arising in satellite communication
• Complexity of a 3-dimensional assignment problem

This page was built for publication: Time-slot assignment for TDMA-systems