On optimally solving sub‐tree scheduling for wireless sensor networks with partial coverage: A branch‐and‐cut algorithm

DOI10.1002/net.22145zbMath1529.90024OpenAlexW4323042713MaRDI QIDQ6179695

Nicola Bianchessi

Publication date: 18 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.22145

zbMATH Keywords

branch-and-cut algorithmwireless sensor networkpartial coverageenergy consumption minimizationconsecutive time slotssub-tree scheduling

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) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Optimization by Simulated Annealing
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Variable neighborhood search
• Variable Neighborhood Search
• Solution of a Large-Scale Traveling-Salesman Problem

This page was built for publication: On optimally solving sub‐tree scheduling for wireless sensor networks with partial coverage: A branch‐and‐cut algorithm