An Algorithm for the Design of Multitype Concentrator Networks

DOI10.1057/jors.1993.83zbMath0774.90034OpenAlexW2073246251MaRDI QIDQ5289661

Choong Y. Lee

Publication date: 2 September 1993

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.1993.83

zbMATH Keywords

Lagrangean relaxationheuristicBenders decompositioncross decompositionconcentrator location problemtopological design of computer communication networks

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (4)

Network flow models for the local access network expansion problem ⋮ A node rooted flow-based model for the local access network expansion problem ⋮ Lower and upper bounds for a two-level hierarchical location problem in computer networks ⋮ Optimisation of the interconnecting network of a UMTS radio mobile telephone system

This page was built for publication: An Algorithm for the Design of Multitype Concentrator Networks