Minimum power multicasting problem in wireless networks

DOI10.1007/s00186-008-0222-0zbMath1279.90026OpenAlexW2090108691MaRDI QIDQ953297

Valeria Leggieri, Paolo Nobili, Chefi Triki

Publication date: 17 November 2008

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

Full work available at URL: https://doi.org/10.1007/s00186-008-0222-0

zbMATH Keywords

set covering problemmulticast problem

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Deterministic network models in operations research (90B10)

Related Items

Cutting-plane-based algorithms for two branch vertices related spanning tree problems ⋮ Submodular Formulations for Range Assignment Problems ⋮ Some Valid Inequalities for the Probabilistic Minimum Power Multicasting Problem ⋮ Wireless multicasting under probabilistic node failures: a heuristic approach ⋮ A branch and price algorithm for the minimum power multicasting problem in wireless sensor networks ⋮ Connectivity-and-hop-constrained design of electricity distribution networks ⋮ A linear programming-based evolutionary algorithm for the minimum power broadcast problem in wireless sensor networks ⋮ Minimum power multicasting in wireless networks under probabilistic node failures ⋮ A Branch-and-Cut Approach for the Minimum-Energy Broadcasting Problem in Wireless Networks ⋮ Multicast problems in telecommunication networks ⋮ Integer programming formulations for the shared multicast tree problem

Cites Work

• An exact algorithm for the robust shortest path problem with interval data
• A survey of combinatorial optimization problems in multicast routing
• Mixed integer formulations for the probabilistic minimum energy broadcast problem in wireless networks
• Trees and Cuts
• Algorithms for energy-efficient multicasting in static ad hoc wireless networks
• Unnamed Item
• Unnamed Item