A New Class of Algorithms for Multipoint Network Optimization

DOI10.1109/TCOM.1976.1093334zbMath0351.90082OpenAlexW2114045721WikidataQ29398277 ScholiaQ29398277MaRDI QIDQ4121719

Maurice Karnaugh

Publication date: 1976

Published in: IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tcom.1976.1093334

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10)

Related Items

Greedy heuristics for the diameter-constrained minimum spanning tree problem ⋮ A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem ⋮ Enhanced second order algorithm applied to the capacitated minimum spanning tree problem ⋮ A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem ⋮ Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem ⋮ Topological design of telecommunication networks --- local access design methods ⋮ Dynamic programming based heuristics for the topological design of local access networks ⋮ VNS and second order heuristics for the min-degree constrained minimum spanning tree problem ⋮ Heuristic procedure neural networks for the CMST problem ⋮ A LEARNING AUTOMATA-BASED ALGORITHM TO THE STOCHASTIC MIN-DEGREE CONSTRAINED MINIMUM SPANNING TREE PROBLEM

This page was built for publication: A New Class of Algorithms for Multipoint Network Optimization