The Gateways Location and Topology Assignment Problem in Hierarchical Wide Area Networks: Algorithms and Computational Results

DOI10.1007/11751595_115zbMath1172.68336OpenAlexW170868779MaRDI QIDQ3600190

A. Kasprzak, Przemyslaw Ryba

Publication date: 10 February 2009

Published in: Computational Science and Its Applications - ICCSA 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11751595_115

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Network design and communication in computer systems (68M10) Approximation methods and heuristics in mathematical programming (90C59) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Anycasting in connection-oriented computer networks: Models, algorithms and results

This page was built for publication: The Gateways Location and Topology Assignment Problem in Hierarchical Wide Area Networks: Algorithms and Computational Results