The Multi-Tier Tree Problem
From MaRDI portal
Publication:5690261
DOI10.1287/ijoc.8.3.202zbMath0871.90101MaRDI QIDQ5690261
Publication date: 5 October 1997
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.8.3.202
telecommunication; Steiner-tree problem; dual-based solution procedure; multi-tier tree problem; recursive heuristic
90C35: Programming involving graphs or networks
90C06: Large-scale problems in mathematical programming
90B18: Communication networks in operations research
Related Items
Optimal design of hierarchical networks with free main path extremes, A branch and cut algorithm for the hierarchical network design problem