scientific article; zbMATH DE number 1532269

zbMath0965.90004MaRDI QIDQ4517675

Martin Grötschel, Andreas Bley, Roland Wessäly

Publication date: 5 August 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

heuristicssurvivable network designshortest path routingnetwork capacity planningOSPF routing

Mathematics Subject Classification ID

Mixed integer programming (90C11) Methods of quasi-Newton type (90C53) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items (10)

Multiobjective design of survivable IP networks ⋮ An Integer Programming Algorithm for Routing Optimization in IP Networks ⋮ Routing and Capacity Optimization for IP Networks ⋮ Intra-domain traffic engineering with shortest path routing protocols ⋮ An integer programming algorithm for routing optimization in IP networks ⋮ Intra-domain traffic engineering with shortest path routing protocols ⋮ On the small cycle transversal of planar graphs ⋮ On the Small Cycle Transversal of Planar Graphs ⋮ On finding cycle bases and fundamental cycle bases with a shortest maximal cycle ⋮ Optimization of OSPF Routing in IP Networks

Uses Software

• TSPLIB

This page was built for publication: