Dynamic programming based heuristics for the topological design of local access networks

DOI10.1007/BF02071978zbMath0736.90032MaRDI QIDQ1179743

S. Singh

Publication date: 27 June 1992

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

decompositionclusteringheuristicminimal spanning treeadditional constraintdata communication network designterminal layout problem

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Dynamic programming (90C39) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (8)

Heuristics for multi-period capacity expansion in local telecommunications networks ⋮ The capacitated minimum spanning tree problem: On improved multistar constraints ⋮ A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem ⋮ A biased random-key genetic algorithm for the capacitated minimum spanning tree problem ⋮ Matheuristics: survey and synthesis ⋮ Multi-period capacity expansion for a local access telecommunications network ⋮ Heuristic procedure neural networks for the CMST problem ⋮ A dynamic programming algorithm for the local access telecommunication network expansion problem

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

This page was built for publication: Dynamic programming based heuristics for the topological design of local access networks