Publication:4517675
From MaRDI portal
zbMath0965.90004MaRDI QIDQ4517675
Martin Grötschel, Andreas Bley, Roland Wessäly
Publication date: 5 August 2001
heuristics; survivable network design; shortest path routing; network capacity planning; OSPF routing
90C11: Mixed integer programming
90C53: Methods of quasi-Newton type
90B10: Deterministic network models in operations research
90C27: Combinatorial optimization
Related Items
Routing and Capacity Optimization for IP Networks, Intra-domain traffic engineering with shortest path routing protocols, Intra-domain traffic engineering with shortest path routing protocols, An integer programming algorithm for routing optimization in IP networks, On the small cycle transversal of planar graphs, On finding cycle bases and fundamental cycle bases with a shortest maximal cycle, Multiobjective design of survivable IP networks, On the Small Cycle Transversal of Planar Graphs, Optimization of OSPF Routing in IP Networks, An Integer Programming Algorithm for Routing Optimization in IP Networks
Uses Software