Computing capacitated minimal spanning trees efficiently

DOI10.1002/NET.3230040403zbMATH Open0311.90070OpenAlexW2074744922MaRDI QIDQ4071024FDOQ4071024

Aaron Kershenbaum

Publication date: 1974

Published in: Networks (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35)

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem

Cited In (8)

• Heuristic methods and applications: A categorized survey
• A Lagrangian based heuristic for the design of multipoint linkages in a communication network with unreliable links and node outage costs.
• An exact algorithm for the capacitated shortest spanning arborescence
• Topological design of a centralized communication network with unreliable links and node outage costs
• Enhanced second order algorithm applied to the capacitated minimum spanning tree problem
• Complexity of spanning tree problems: Part I
• Design of capacitated degree constrained min-sum arborescence
• The Minimum Spanning Tree Problem with Time Window Constraints

This page was built for publication: Computing capacitated minimal spanning trees efficiently

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