An Approximate Algorithm for the Minimal Cost Gateways Location, Capacity and Flow Assignment in Two-Level Hierarchical Wide Area Networks
From MaRDI portal
Publication:3545013
DOI10.1007/11758501_18zbMath1155.68314MaRDI QIDQ3545013
Publication date: 9 December 2008
Published in: Computational Science – ICCS 2006 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11758501_18
Related Items
Lagrangean heuristic for primary routes assignment in survivable connection-oriented networks, A Flow Deviation Algorithm for Joint Optimization of Unicast and Anycast Flows in Connection-Oriented Networks