A dynamic programming algorithm for the local access telecommunication network expansion problem
type: Item
instance of: scholarly article
title: A dynamic programming algorithm for the local access telecommunication network expansion problem
zbMATH Open document ID: 0979.90016
DOI: 10.1016/S0377-2217(99)00340-9
author: Olaf E. Flippo
author: Antoon W. J. Kolen
author: Arie M. C. A. Koster
author: Robert L. M. J. van de Leensel
published in: European Journal of Operational Research
publication date: 2000-12-21T00:00:00Z
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 1548103
zbMATH Keywords: dynamic programming
zbMATH Keywords: telecommunication networks
MaRDI profile type: Publication
cites work: Optimal expansion of capacitated transshipment networks
cites work: A Dual-Based Algorithm for Multi-Level Network Design
cites work: Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem
cites work: Models for planning capacity expansion in local access telecommunication networks
cites work: A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning
cites work: Packing and covering a tree by subtrees
cites work: Minimum cost capacity installation for multicommodity network flows
cites work: Capacitated Network Design—Polyhedral Structure and Computation
cites work: Lower Bounding Procedures for Multiperiod Telecommunications Network Expansion Problems
cites work: Topological design of telecommunication networks --- local access design methods
cites work: Topological design of computer communication networks -- the overall design problem
cites work: Dynamic programming based heuristics for the topological design of local access networks
cites work: Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
cites work: Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements
cites work: A characterization of the uncapacitated network design polytope
cites work: Design and Implementation of an Interactive Optimization System for Telephone Network Planning
cites work: On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
cites work: Locating concentrators in centralized computer networks
cites work: A suboptimal solution to a hierarchical network design problem using dynamic programming
cites work: A decomposition algorithm for capacity expansion of local access networks
full work available at URL: s0377-2217(99)00340-9
OpenAlex ID: W2076238711
description: scientific article; zbMATH DE number 1548103