The Capacitated Minimum Spanning Tree

DOI10.1002/NET.3230030204MaRDI QIDQ5671761zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(15)

• 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
• A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection
• An exact algorithm for the capacitated shortest spanning arborescence
• A multiperiod planning model for the capacitated minimal spanning tree problem
• Design of capacitated degree constrained min-sum arborescence
• A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem
• A voltage drop limited decentralized electric power distribution network
• The Minimum Spanning Tree Problem with Time Window Constraints
• Heuristics with Constant Error Guarantees for the Multi Center Capacitated Minimum Spanning Tree Problem
• Two Matching Based Algorithm for Tree Network Design
• Finding conflict-free minimum weight spanning trees using maximal stable sets of the conflict graph
• Models for planning capacity expansion in local access telecommunication networks
• Enhanced second order algorithm applied to the capacitated minimum spanning tree problem

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

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