Traffic assignment in communication satellites
From MaRDI portal
Publication:594769
DOI10.1016/0167-6377(83)90045-7zbMath0526.90065OpenAlexW2000732156MaRDI QIDQ594769
Philip R. Landweer, Egon Balas
Publication date: 1983
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(83)90045-7
heuristic algorithmtraffic assignmentcommunication satellitesthree-dimensional bottleneck-sum assignment
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)
Related Items
Solving the \(k\)-cardinality assignment problem by transformation ⋮ A combinatorial algorithm for the TDMA message scheduling problem ⋮ A heuristic for decomposing traffic matrices in TDMA satellite communication ⋮ New bounds for optimum traffic assignment in satellite communication. ⋮ A survey of dynamic network flows ⋮ Random assignment problems ⋮ Selected topics on assignment problems ⋮ Time-slot assignment for TDMA-systems ⋮ Facets of the three-index assignment polytope ⋮ An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment ⋮ Multidimensional assignment problem for multipartite entity resolution ⋮ Penalty computations for the set partitioning problem ⋮ On the complexity of decomposing matrices arising in satellite communication ⋮ The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm
Cites Work
