A Branch-and-Cut Approach for the Minimum-Energy Broadcasting Problem in Wireless Networks

DOI10.1287/ijoc.1110.0463zbMath1460.90058OpenAlexW2159152015MaRDI QIDQ2815458

Xiangyong Li, Yash P. Aneja

Publication date: 29 June 2016

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1110.0463

zbMATH Keywords

algorithminteger programmingcutting planewireless networksminimum-energy topology

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18)

Related Items (1)

An integer programming formulation of the key management problem in wireless sensor networks

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Minimum power multicasting problem in wireless networks
• Analysis and computational study of several integer programming formulations for minimum-energy multicasting in wireless ad hoc networks
• Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
• Solving Large-Scale Zero-One Linear Programming Problems
• A Faster Algorithm for Finding the Minimum Cut in a Directed Graph

This page was built for publication: A Branch-and-Cut Approach for the Minimum-Energy Broadcasting Problem in Wireless Networks