On optimally solving sub-tree scheduling for wireless sensor networks with partial coverage: A branch-and-cut algorithm.
Nicola BianchessiPublished in: Networks (2023)
Keyphrases
- cost function
- tree structure
- learning algorithm
- wireless sensor networks
- significant improvement
- preprocessing
- dynamic programming
- k means
- computational complexity
- particle swarm optimization
- matching algorithm
- detection algorithm
- neural network
- np hard
- optimal solution
- worst case
- expectation maximization
- objective function
- gradient projection
- sensor networks
- response time
- search space
- segmentation algorithm
- optimization algorithm
- data structure
- graph structure
- minimum spanning tree