A branch and price algorithm for the minimum power multicasting problem in wireless sensor networks

DOI10.1007/S00186-011-0365-2MaRDI QIDQ1935910zbMATH OpenOpenAlexFDO

Authors Roberto Montemanni, Valeria Leggieri

Publication date 20 February 2013

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

Full work available at URL http://doc.rero.ch/record/318290/files/186_2011_Article_365.pdf

zbMATH Keywords

branch and priceminimum power topologywireless networks

Mathematics Subject Classification ID

Mixed integer programming (90C11) Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Minimum power multicasting problem in wireless networks
• A branch-and-cut approach for the minimum-energy broadcasting problem in wireless networks
• A Branch-and-Cut Algorithm for the Minimum Energy Symmetric Connectivity Problem in Wireless Networks
• Branch-and-price algorithm for a multicast routing problem
• A branch-and-cut algorithm for the strong minimum energy topology in wireless sensor networks

Cites work

• A note on two problems in connexion with graphs
• A survey of combinatorial optimization problems in multicast routing
• Algorithms for energy-efficient multicasting in static ad hoc wireless networks
• An exact algorithm for the robust shortest path problem with interval data
• Analysis and computational study of several integer programming formulations for minimum-energy multicasting in wireless ad hoc networks
• scientific article; zbMATH DE number 1688358 (Why is no real title available?)
• Interior point stabilization for column generation
• Minimum power multicasting problem in wireless networks
• Multicast problems in telecommunication networks
• Selected Topics in Column Generation
• Shortest Path Problems with Resource Constraints

Cited in

(13)

• A branch-and-cut algorithm for the strong minimum energy topology in wireless sensor networks
• Integer programming formulations for the shared multicast tree problem
• A branch-and-cut approach for the minimum-energy broadcasting problem in wireless networks
• Some valid inequalities for the probabilistic minimum power multicasting problem
• A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks
• A Branch-and-Cut Algorithm for the Minimum Energy Symmetric Connectivity Problem in Wireless Networks
• Wireless multicasting under probabilistic node failures: a heuristic approach
• Minimum power multicasting in wireless networks under probabilistic node failures
• Branch‐and‐price for energy optimization in multi‐hop wireless sensor networks
• On optimally solving sub‐tree scheduling for wireless sensor networks with partial coverage: A branch‐and‐cut algorithm
• A linear programming-based evolutionary algorithm for the minimum power broadcast problem in wireless sensor networks
• An iterative exact solution for the dual power management problem in wireless sensor network
• Minimum power multicasting problem in wireless networks

This page was built for publication: A branch and price algorithm for the minimum power multicasting problem in wireless sensor networks

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