The Multi-Tier Tree Problem

DOI10.1287/IJOC.8.3.202zbMATH Open0871.90101OpenAlexW2062268671MaRDI QIDQ5690261FDOQ5690261

Authors: P. 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

Recommendations

• Trees and Keisler's problem
• The Push Tree problem
• The maximum binary tree problem
• The Maximum Binary Tree Problem.
• scientific article; zbMATH DE number 3891405
• Multi-level Steiner trees
• Multi-Level Steiner Trees.
• scientific article; zbMATH DE number 1638647
• scientific article; zbMATH DE number 1210933
• Optimization problems in multiple subtree graphs

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cited In (5)

• Multi-level Steiner Trees
• Multi-Level Steiner Trees.
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5690261)