A polynomial-time algorithm for message routing in hierarchical communication networks

DOI10.1016/0377-2217(93)E0350-7zbMath0915.90106MaRDI QIDQ1129965

George G. Polak, Ravindra K. Ahuja

Publication date: 5 November 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

spanning treepolynomial-time algorithmhierarchical communication networktwo-level network

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Communication networks in operations research (90B18) Transportation, logistics and supply chain management (90B06)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An Application of Generalized Linear Programming to Network Flows
• Network design and dynamic routing under queueing demand
• A linear programming model for design of communications networks with time varying probabilistic demands
• A Descent Algorithm for the Multihour Sizing of Traffic Networks
• Analytic Approximation of Blocking Probabilities in Circuit Switched Communication Networks

This page was built for publication: A polynomial-time algorithm for message routing in hierarchical communication networks