Algorithms for the optimum communication spanning tree problem

DOI10.1007/s10479-006-7382-1zbMath1101.90058OpenAlexW2058966397MaRDI QIDQ2507388

Prabha Sharma

Publication date: 11 October 2006

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

Full work available at URL: https://doi.org/10.1007/s10479-006-7382-1

zbMATH Keywords

cut-treeadjacent basic feasible solutionadjacent spanning treecost of communicationstar-tree

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Models and algorithms for network reduction ⋮ Combined column-and-row-generation for the optimal communication spanning tree problem ⋮ Lagrangean bounds for the optimum communication spanning tree problem ⋮ New Valid Inequalities for the Optimal Communication Spanning Tree Problem ⋮ Solving the optimum communication spanning tree problem

Cites Work

• Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem
• Constrained Optimum Communication Trees and Sensitivity Analysis
• The complexity of the network design problem

This page was built for publication: Algorithms for the optimum communication spanning tree problem