scientific article; zbMATH DE number 1532269

zbMATH Open0965.90004MaRDI QIDQ4517675FDOQ4517675

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

Publication date: 5 August 2001

Title of this publication is not available (Why is that?)

Recommendations

• Provisioning a virtual private network: a network design problem for multicommodity flow
• Provisioning virtual private networks under traffic uncertainty
• Automata, Languages and Programming
• Virtual private network design
• An improved approximation algorithm for virtual private network design

zbMATH Keywords

heuristicssurvivable network designshortest path routingnetwork capacity planningOSPF routing

Mathematics Subject Classification ID

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

Cited In (13)

• Design of survivable VoIP networks using the VPN concept
• On finding cycle bases and fundamental cycle bases with a shortest maximal cycle
• An integer programming algorithm for routing optimization in IP networks
• An Integer Programming Algorithm for Routing Optimization in IP Networks
• On the small cycle transversal of planar graphs
• Intra-domain traffic engineering with shortest path routing protocols
• Multiobjective design of survivable IP networks
• Optimization of OSPF routing in IP networks
• Some approaches to solving a multihour broadband network capacity design problem with single-path routing
• A GRASP with path-relinking for private virtual circuit routing
• On the small cycle transversal of planar graphs
• Routing and capacity optimization for IP networks
• Intra-domain traffic engineering with shortest path routing protocols

Uses Software

• TSPLIB

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4517675)