Dynamic programming based heuristics for the topological design of local access networks
From MaRDI portal
Publication:1179743
DOI10.1007/BF02071978zbMath0736.90032MaRDI QIDQ1179743
Publication date: 27 June 1992
Published in: Annals of Operations Research (Search for Journal in Brave)
decomposition; clustering; heuristic; minimal spanning tree; additional constraint; data communication network design; terminal layout problem
90B18: Communication networks in operations research
68M10: Network design and communication in computer systems
90C39: Dynamic programming
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Cites Work
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Heuristics with Constant Error Guarantees for the Design of Tree Networks
- The complexity of the capacitated tree problem
- A New Class of Algorithms for Multipoint Network Optimization
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
- The Capacitated Minimum Spanning Tree