The Capacitated Minimum Spanning Tree
From MaRDI portal
Publication:5671761
DOI10.1002/net.3230030204zbMath0256.90016MaRDI QIDQ5671761
Publication date: 1973
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230030204
90B10: Deterministic network models in operations research
Related Items
Two Matching Based Algorithm for Tree Network Design, Topological design of telecommunication networks --- local access design methods, Dynamic programming based heuristics for the topological design of local access networks, Topological design of a centralized communication network with unreliable links and node outage costs, An exact algorithm for the capacitated shortest spanning arborescence, A multiperiod planning model for the capacitated minimal spanning tree problem, Heuristics with Constant Error Guarantees for the Multi Center Capacitated Minimum Spanning Tree Problem