Sub-Tree Scheduling for Wireless Sensor Networks with Partial Coverage (STSWSN-PC) Dataset

This dataset contains new benchmark instances for the optimization problem introduced by Adasme (2019) under the name Sub-Tree Scheduling for Wireless Sensor Networks with Partial Coverage (STSWSN-PC). The instances are those addressed in Bianchessi (2022), in which a complete description of the procedure used to define them is also reported. For more details see the REAMDE.txt file. References: - Adasme, P. (2019). Optimal sub-tree scheduling for wireless sensor networks with partial coverage. Computer Standards & Interfaces, 61, 20-35. - Bianchessi, N. (2022). On optimally solving sub-tree scheduling for wireless sensor networks with partial coverage (Report link: https://hdl.handle.net/2434/934107). Università degli Studi di Milano. Submitted to Networks (ISSN: 0028-3045) as 'On optimally solving sub-tree scheduling for wireless sensor networks with partial coverage: a branch-and-cut algorithm' - second revision.