On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem
From MaRDI portal
Publication:3596341
DOI10.1007/11496915_8zbMath1119.90065MaRDI QIDQ3596341
Publication date: 30 August 2007
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11496915_8
90C35: Programming involving graphs or networks
90C60: Abstract computational complexity for mathematical programming problems
90B18: Communication networks in operations research
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
05C38: Paths and cycles
90B20: Traffic problems in operations research
Related Items
Routing and Capacity Optimization for IP Networks, Approximability of unsplittable shortest path routing problems, A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion, Optimization of OSPF Routing in IP Networks, An Integer Programming Algorithm for Routing Optimization in IP Networks
