Traffic engineering of tunnel-based networks with class specific diversity requirements

DOI10.1007/s10878-006-8907-xzbMath1130.94028OpenAlexW2070759125MaRDI QIDQ857786

Deep Medhi, Shekhar Srivastava

Publication date: 5 January 2007

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-006-8907-x

zbMATH Keywords

Diversity constraintLagrangian decomposition algorithmOptimization formulationTunnel-based networks

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Circuits, networks (94C99)

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving Steiner tree problems in graphs with Lagrangian relaxation
• Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound
• Validation of subgradient optimization

This page was built for publication: Traffic engineering of tunnel-based networks with class specific diversity requirements