On the complexity of decomposing matrices arising in satellite communication
From MaRDI portal
Publication:1060960
DOI10.1016/0167-6377(85)90042-2zbMath0569.90064OpenAlexW2011308503MaRDI QIDQ1060960
Publication date: 1985
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(85)90042-2
computational complexityheuristicmatrix decompositioncommunication matricesDecomposing a square matrixintercity communicationtransmission satellitesweighted sum of permutation matrices
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Integer programming (90C10)
Related Items (max. 100)
THE PROPORTIONAL COLORING PROBLEM: OPTIMIZING BUFFERS IN RADIO MESH NETWORKS ⋮ A heuristic for decomposing traffic matrices in TDMA satellite communication ⋮ The assignment problem with nearly Monge arrays and incompatible partner indices ⋮ Time slot scheduling of compatible jobs ⋮ On the max-weight edge coloring problem ⋮ New bounds for optimum traffic assignment in satellite communication. ⋮ Open shop scheduling with synchronization ⋮ Constrained partitioning problems ⋮ Minimum perfect bipartite matchings and spanning trees under categorization ⋮ Selected topics on assignment problems ⋮ A hypocoloring model for batch scheduling ⋮ Time-slot assignment for TDMA-systems ⋮ On the Maximum Edge Coloring Problem ⋮ An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment ⋮ On the complexity of decomposing matrices arising in satellite communication
Cites Work
This page was built for publication: On the complexity of decomposing matrices arising in satellite communication