A Branch-and-Bound Algorithm for Building Optimal Data Gathering Tree in Wireless Sensor Networks

DOI10.1287/ijoc.2020.1012zbMath1492.90033OpenAlexW3129393807MaRDI QIDQ5084608

Shaojie Tang, Xiaojun Zhu

Publication date: 28 June 2022

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

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

zbMATH Keywords

branch-and-bound algorithmwireless sensor networksdata gathering tree

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18) Linear programming (90C05)

Related Items (2)

BranchBoundforWSN ⋮ Exact Algorithms for Maximum Lifetime Data-Gathering Tree in Wireless Sensor Networks

Cites Work

• A data structure for dynamic trees
• Branching rules revisited
• The capacitated minimum spanning tree problem: On improved multistar constraints
• Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
• (Almost) Tight bounds and existence theorems for single-commodity confluent flows
• Reformulation and Decomposition of Integer Programs
• Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
• A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem

This page was built for publication: A Branch-and-Bound Algorithm for Building Optimal Data Gathering Tree in Wireless Sensor Networks