Pages that link to "Item:Q2387246"
From MaRDI portal
The following pages link to A survey of combinatorial optimization problems in multicast routing (Q2387246):
Displaying 42 items.
- A simulated annealing based genetic local search algorithm for multi-objective multicast routing problems (Q363596) (← links)
- Gossiping and routing in second-kind Frobenius graphs (Q427787) (← links)
- The Steiner tree problem with delays: a compact formulation and reduction procedures (Q496653) (← links)
- Data transfer planning with tree placement for collaborative environments (Q647480) (← links)
- A linear programming-based evolutionary algorithm for the minimum power broadcast problem in wireless sensor networks (Q662130) (← links)
- Optimal solutions to minimum total energy broadcasting problem in wireless ad hoc networks (Q857761) (← links)
- Optimal doublecast path in hexagonal honeycomb mesh (Q858789) (← links)
- Reliable overlay multicast trees for private internet broadcasting with multiple sessions (Q875431) (← links)
- OMEGa: an optimistic most energy gain method for minimum energy multicasting in wireless ad hoc networks (Q941837) (← links)
- Minimum power multicasting problem in wireless networks (Q953297) (← links)
- Redundant multicast routing in multilayer networks with shared risk resource groups: complexity, models and algorithms (Q976036) (← links)
- A column generation based heuristic for sensor placement, activity scheduling and data routing in wireless sensor networks (Q992709) (← links)
- Multicast problems in telecommunication networks (Q1022443) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- Extended formulation for hop constrained distribution network configuration problems (Q1681271) (← links)
- Reliability evaluation of a multicast over coded packet networks (Q1743495) (← links)
- Minimization of multicast traffic and ensuring its fault tolerance in software-defined networks (Q1792411) (← links)
- Uncapacitated point-to-multipoint network flow problem and its application to multicasting in telecommunication networks (Q1869722) (← links)
- A branch-and-cut algorithm for the Steiner tree problem with delays (Q1926621) (← links)
- A branch and price algorithm for the minimum power multicasting problem in wireless sensor networks (Q1935910) (← links)
- The dynamic replica placement problem with service levels in content delivery networks: a model and a simulated annealing heuristic (Q2260900) (← links)
- A distributed dual ascent algorithm for the Hop-constrained Steiner tree problem (Q2270325) (← links)
- Mixed integer formulations for a routing problem with information collection in wireless networks (Q2273919) (← links)
- Parameterized analysis of the online priority and node-weighted Steiner tree problems (Q2322716) (← links)
- Mathematical programming approaches for dual multicast routing problem with multilayer risk cost (Q2393468) (← links)
- UBMR-CA: utility-based multicast routing and channel assignment with varying traffic demands in multi-radio multi-channel wireless mesh networks (Q2450517) (← links)
- Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing (Q2462555) (← links)
- Total energy optimal multicasting in wireless ad hoc networks (Q2467570) (← links)
- An improved approximation algorithm for capacitated multicast routings in networks (Q2474074) (← links)
- The set covering problem revisited: an empirical study of the value of dual information (Q2514674) (← links)
- An Algorithm to Find the Link Constrained Steiner Tree in Undirected Graphs (Q2819269) (← links)
- An exact algorithm for the Steiner tree problem with delays (Q2883568) (← links)
- Online Priority Steiner Tree Problems (Q3183439) (← links)
- A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry (Q3541076) (← links)
- A Lagrangean-based decomposition approach for the link constrained Steiner tree problem (Q4637834) (← links)
- A distributed dual ascent algorithm for Steiner problems in multicast routing (Q5191138) (← links)
- A Hybrid Metaheuristic for Routing on Multicast Networks (Q5265221) (← links)
- The power of recourse for online MST and TSP (Q5890825) (← links)
- Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax‐and‐fix heuristic (Q6066592) (← links)
- Lagrangian relaxation for maximum service in multicast routing with QoS constraints (Q6082266) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
- The open location-routing problem for multi-objective optimization of sustainable supply chain considering social concerns (Q6175351) (← links)