Mathematical programming approaches for dual multicast routing problem with multilayer risk cost

DOI10.1007/S10479-013-1317-4zbMATH Open1269.90030OpenAlexW2072798329MaRDI QIDQ2393468FDOQ2393468

Authors: Zhe Liang, Chungmok Lee, Wanpracha A. Chaovalitwongse 

Publication date: 8 August 2013

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-013-1317-4

Recommendations

• A multicast problem with shared 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
• Branch-and-price algorithm for a multicast routing problem
• A distributed dual ascent algorithm for Steiner problems in multicast routing

zbMATH Keywords

multi-objectivemixed integer programmulticasttelecommunicationshared risk link groups

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Selected Topics in Column Generation
• Implementing Mixed Integer Column Generation
• Title not available (Why is that?)
• Node-and edge-deletion NP-complete problems
• Survivable IP network design with OSPF routing
• A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing
• Routing with time windows by column generation
• Optimization problems in multicast tree construction
• A survey of combinatorial optimization problems in multicast routing
• Title not available (Why is that?)
• 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
• On the complexity of the Maximum Subgraph Problem
• A combinatorial algorithm for message scheduling on controller area networks
• Construction algorithms and approximation bounds for the streaming cache placement problem in multicast networks

Cited In (2)

• 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

Uses Software

• SteinLib
• OR-Library

This page was built for publication: Mathematical programming approaches for dual multicast routing problem with multilayer risk cost

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