A multicast problem with shared risk cost

DOI10.1007/S11590-011-0283-5zbMATH Open1258.90020OpenAlexW2091556882MaRDI QIDQ691394FDOQ691394

Authors: Zhe Liang, Wanpracha A. Chaovalitwongse 

Publication date: 30 November 2012

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-011-0283-5

Recommendations

• Mathematical programming approaches for dual multicast routing problem with multilayer risk cost
• Bounds of redundant multicast routing problem with SRLG-diverse constraints: edge, path and tree models
• Redundant multicast routing in multilayer networks with shared risk resource groups: complexity, models and algorithms
• Integer programming formulations for the shared multicast tree problem
• Combinatorial optimization in networks with shared risk link groups

zbMATH Keywords

routingvalid inequalitiesmulticasttelecommunication

Mathematics Subject Classification ID

Mixed integer programming (90C11) Communication networks in operations research (90B18)

Cites Work

• Title not available (Why is that?)
• A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
• A comparison of Steiner tree relaxations
• Improved algorithms for the Steiner problem in networks
• A dual ascent approach for steiner tree problems on a directed graph
• A catalog of steiner tree formulations
• An integer linear programming approach to the steiner problem in graphs
• Efficient and scalable provisioning of always-on multicast streaming services
• A heuristic for the Steiner problem in graphs
• Dynamic lightpath protection in WDM mesh networks under wavelength-continuity and risk-disjoint constraints
• Bounds of redundant multicast routing problem with SRLG-diverse constraints: edge, path and tree models
• Redundant multicast routing in multilayer networks with shared risk resource groups: complexity, models and algorithms

Cited In (5)

• Bounds of redundant multicast routing problem with SRLG-diverse constraints: edge, path and tree models
• Redundant multicast routing in multilayer networks with shared risk resource groups: complexity, models and algorithms
• Combinatorial optimization in networks with shared risk link groups
• Approximation and collusion in multicast cost sharing
• Mathematical programming approaches for dual multicast routing problem with multilayer risk cost

This page was built for publication: A multicast problem with shared risk cost

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