1 to 2 of 2 Results
Dec 18, 2023
Barbato, Michele; Bianchessi, Nicola, 2023, "Replication data for "Sub-tree scheduling for wireless sensor networks with partial coverage: complexity and polynomial-size formulations"", https://doi.org/10.13130/RD_UNIMI/GD9OKQ, UNIMI Dataverse, V1
Instances and detailed experimental results of the research work entitled "Sub-tree scheduling for wireless sensor networks with partial coverage: complexity and polynomial-size formulations". For additional information, please refer to the included readme file. |
Feb 3, 2023
Bianchessi, Nicola, 2023, "Replication data for " On optimally solving sub-tree scheduling for wireless sensor networks with partial coverage: A branch-and-cut algorithm"", https://doi.org/10.13130/RD_UNIMI/IHTWC0, UNIMI Dataverse, V1, UNF:6:o+N3y3vWczdEhAUSUSFb7g== [fileUNF]
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 de... |