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

DOI10.1007/s00186-011-0365-2zbMath1263.90118OpenAlexW1997617211MaRDI QIDQ1935910

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

wireless networksbranch and priceminimum power topology

Mathematics Subject Classification ID

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

Related Items

Integer programming formulations for the shared multicast tree problem

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• Minimum power multicasting problem in wireless networks
• Multicast problems in telecommunication networks
• An exact algorithm for the robust shortest path problem with interval data
• A survey of combinatorial optimization problems in multicast routing
• Interior point stabilization for column generation
• Analysis and computational study of several integer programming formulations for minimum-energy multicasting in wireless ad hoc networks
• Selected Topics in Column Generation
• Shortest Path Problems with Resource Constraints
• Algorithms for energy-efficient multicasting in static ad hoc wireless networks