Featured Dataverses

In order to use this feature you must have at least one published dataverse.

Publish Dataverse

Are you sure you want to publish your dataverse? Once you do so it must remain published.

Publish Dataverse

This dataverse cannot be published because the dataverse it is in has not been published.

Delete Dataverse

Are you sure you want to delete your dataverse? You cannot undelete this dataverse.

Advanced Search

1 to 4 of 4 Results
Mar 13, 2024
Barbato, Michele; Luís Gouveia, 2023, "Replication data for "The Hamiltonian p-median Problem: Polyhedral Results and Branch-and-Cut Algorithms"", https://doi.org/10.13130/RD_UNIMI/UDEATS, UNIMI Dataverse, V3
Dataset containing the experimental results of the research work "The Hamiltonian p-Median Problem: Polyhedral Results and Branch-and-Cut Algorithms".
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.
Sep 27, 2023
Barbato, Michele; Ceselli, Alberto, 2023, "Instances and computational results of: Mathematical Programming for Simultaneous Feature Selection and Outlier Detection under l1 Norm", https://doi.org/10.13130/RD_UNIMI/LZA4F8, UNIMI Dataverse, V1, UNF:6:8qCKYGVl2js4qUPec4qIpg== [fileUNF]
This dataset contains instances and computational results of "Mathematical Programming for Simultaneous Feature Selection and Outlier Detection under l1 Norm". See the included readme files for a description of the dataset content.
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...
Add Data

Sign up or log in to create a dataverse or add a dataset.

Share Dataverse

Share this dataverse on your favorite social media networks.

Link Dataverse
Reset Modifications

Are you sure you want to reset the selected metadata fields? If you do this, any customizations (hidden, required, optional) you have done will no longer appear.