The Capacitated Minimum Spanning Tree

DOI10.1002/NET.3230030204zbMath0256.90016OpenAlexW2152413298MaRDI QIDQ5671761

K. Mani Chandy, Tachen Lo

Publication date: 1973

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230030204

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (14)

Topological design of a centralized communication network with unreliable links and node outage costs ⋮ A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem ⋮ A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection ⋮ An exact algorithm for the capacitated shortest spanning arborescence ⋮ Enhanced second order algorithm applied to the capacitated minimum spanning tree problem ⋮ Two Matching Based Algorithm for Tree Network Design ⋮ Heuristics with Constant Error Guarantees for the Multi Center Capacitated Minimum Spanning Tree Problem ⋮ A voltage drop limited decentralized electric power distribution network ⋮ The Minimum Spanning Tree Problem with Time Window Constraints ⋮ A multiperiod planning model for the capacitated minimal spanning tree problem ⋮ Topological design of telecommunication networks --- local access design methods ⋮ Dynamic programming based heuristics for the topological design of local access networks ⋮ Design of capacitated degree constrained min-sum arborescence ⋮ Models for planning capacity expansion in local access telecommunication networks

This page was built for publication: The Capacitated Minimum Spanning Tree