A survey of combinatorial optimization problems in multicast routing

DOI10.1016/j.cor.2003.12.007zbMath1068.90027OpenAlexW1983799289MaRDI QIDQ2387246

Carlos A. S. Oliveira, Panos M. Pardalos

Publication date: 2 September 2005

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2003.12.007

zbMATH Keywords

Combinatorial optimization Networks Multicast routing

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Traffic problems in operations research (90B20)

Related Items

An Exact Algorithm for the Steiner Tree Problem with Delays, Online Priority Steiner Tree Problems, Optimal solutions to minimum total energy broadcasting problem in wireless ad hoc networks, Optimal doublecast path in hexagonal honeycomb mesh, Mathematical programming approaches for dual multicast routing problem with multilayer risk cost, A simulated annealing based genetic local search algorithm for multi-objective multicast routing problems, Reliable overlay multicast trees for private internet broadcasting with multiple sessions, A branch-and-cut algorithm for the Steiner tree problem with delays, Extended formulation for hop constrained distribution network configuration problems, Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax‐and‐fix heuristic, A branch and price algorithm for the minimum power multicasting problem in wireless sensor networks, Lagrangian relaxation for maximum service in multicast routing with QoS constraints, Solving Steiner trees: Recent advances, challenges, and perspectives, The open location-routing problem for multi-objective optimization of sustainable supply chain considering social concerns, Gossiping and routing in second-kind Frobenius graphs, Data transfer planning with tree placement for collaborative environments, UBMR-CA: utility-based multicast routing and channel assignment with varying traffic demands in multi-radio multi-channel wireless mesh networks, A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry, A linear programming-based evolutionary algorithm for the minimum power broadcast problem in wireless sensor networks, A Lagrangean-based decomposition approach for the link constrained Steiner tree problem, OMEGa: an optimistic most energy gain method for minimum energy multicasting in wireless ad hoc networks, Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing, The Steiner tree problem with delays: a compact formulation and reduction procedures, Reliability evaluation of a multicast over coded packet networks, Total energy optimal multicasting in wireless ad hoc networks, Minimum power multicasting problem in wireless networks, The dynamic replica placement problem with service levels in content delivery networks: a model and a simulated annealing heuristic, Redundant multicast routing in multilayer networks with shared risk resource groups: complexity, models and algorithms, A distributed dual ascent algorithm for the Hop-constrained Steiner tree problem, A distributed dual ascent algorithm for Steiner problems in multicast routing, A column generation based heuristic for sensor placement, activity scheduling and data routing in wireless sensor networks, Minimization of multicast traffic and ensuring its fault tolerance in software-defined networks, The Power of Recourse for Online MST and TSP, The set covering problem revisited: an empirical study of the value of dual information, An Algorithm to Find the Link Constrained Steiner Tree in Undirected Graphs, Multicast problems in telecommunication networks, Combinatorial optimization in system configuration design, Parameterized analysis of the online priority and node-weighted Steiner tree problems, A Hybrid Metaheuristic for Routing on Multicast Networks

Cites Work