The Multi-Tier Tree Problem

DOI10.1287/ijoc.8.3.202zbMath0871.90101OpenAlexW2062268671MaRDI QIDQ5690261

Prakash Mirchandani

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

zbMATH Keywords

telecommunicationSteiner-tree problemdual-based solution proceduremulti-tier tree problemrecursive heuristic

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Large-scale problems in mathematical programming (90C06) Communication networks in operations research (90B18)

Related Items (5)

A branch and cut algorithm for the hierarchical network design problem ⋮ Approximation algorithms for priority Steiner tree problems ⋮ Optimal design of hierarchical networks with free main path extremes ⋮ Multi-level Steiner Trees ⋮ Multi-Level Steiner Trees.

This page was built for publication: The Multi-Tier Tree Problem