A heuristic for decomposing traffic matrices in TDMA satellite communication
From MaRDI portal
Publication:4277996
DOI10.1007/BF01416610zbMath0785.90069MaRDI QIDQ4277996
Publication date: 13 April 1994
Published in: [https://portal.mardi4nfdi.de/entity/Q3199221 ZOR Zeitschrift f� Operations Research Methods and Models of Operations Research] (Search for Journal in Brave)
edge coloringNP-hardheuristicmatrix decompositionscaling techniqueapportionmentvoting systemsbottleneck assignmentgreedy heuristicssatellite communicationtime-division multiple access
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Traffic assignment in communication satellites
- On the complexity of decomposing matrices arising in satellite communication
- How proportional is proportional representation?
- Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
- The complexity of selection and ranking in X+Y and matrices with sorted columns
- An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment
- Time-slot assignment for TDMA-systems
- Optimal traffic assignment in a SS/TDMA frame : a new approach by set covering and column generation
- Algorithms for two bottleneck optimization problems
- On Edge Coloring Bipartite Graphs
- A Theory of Proportional Representation
- A heuristic for decomposing traffic matrices in TDMA satellite communication
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
This page was built for publication: A heuristic for decomposing traffic matrices in TDMA satellite communication
