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

DOI10.1007/s10479-013-1317-4zbMath1269.90030MaRDI QIDQ2393468

Wanpracha Art Chaovalitwongse, Zhe Liang, Chungmok Lee

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

zbMATH Keywords

multicast; multi-objective; mixed integer program; telecommunication; shared risk link groups

Mathematics Subject Classification ID

90C11: Mixed integer programming

90B18: Communication networks in operations research

Uses Software

• SteinLib
• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounds of redundant multicast routing problem with SRLG-diverse constraints: edge, path and tree models
• Construction algorithms and approximation bounds for the streaming cache placement problem in multicast networks
• Redundant multicast routing in multilayer networks with shared risk resource groups: complexity, models and algorithms
• Efficient and scalable provisioning of always-on multicast streaming services
• A heuristic for the Steiner problem in graphs
• A survey of combinatorial optimization problems in multicast routing
• Dynamic lightpath protection in WDM mesh networks under wavelength-continuity and risk-disjoint constraints
• A combinatorial algorithm for message scheduling on controller area networks
• Survivable IP network design with OSPF routing
• Routing with time windows by column generation
• A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing
• Selected Topics in Column Generation
• Node-and edge-deletion NP-complete problems
• On the complexity of the Maximum Subgraph Problem
• Implementing Mixed Integer Column Generation