scientific article; zbMATH DE number 1532269

MaRDI QIDQ4517675zbMATH OpenFDO

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

Publication date 5 August 2001

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)

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

Cited in

(13)

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

Describes a project that uses

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)