Find research datasets worth reusing
Search datasets from major research repositories and use ShareScore to quickly assess how well each record supports discovery, access, and reuse.
12
datasets available to search
ShareScore release 0.9.0
Dataset results
12 results for “integer programming”
Dataset for article: Integer programming for optimal yaw control of wind farms
<div> <p>This is the dataset for the article "Integer programming for optimal yaw control of wind farms". We provide the integer programs (lp-files) and corresponding solver log files for each case of our series of experiments. Submission of manuscript: September 2024 (v1). Major revision of manuscript: February 2025 (v2). Minor revision of manuscript: April 2025 (v3).</p> </div>
SurrogateLIB: An extendable library of mixed-integer programs with embedded machine learning predictors
<p>We constructed a set of Mixed-Integer Programming (MIP) instances with embedded Machine Learning (ML) predictors. The generators for these instances are available at: <a href="https://github.com/Opt-Mucca/PySCIPOpt-ML">https://github.com/Opt-Mucca/PySCIPOpt-ML</a>. The full paper which introduces SurrogateLIB and the larger Python framework PySCIPOpt-ML is available at: <a href="https://arxiv.org/abs/2312.08074">https://arxiv.org/abs/2312.08074</a></p>
Stochastic Mixed-Integer Programming for a Spare Parts Inventory Management Problem
<p>The German Armed Forces provide an operation contingent to support the North Atlantic Treaty Organization (NATO) Response Force (NRF). For short deployments (e.g., one month), the NRF troops can bring with them a tightly constrained "warehouse" of spare parts. To ensure optimal use this warehouse, we developed the computer program "The OPtimization of a Spare Parts INventory" (TOPSPIN) to find an optimal mix of spare parts to repair a set of systems. Each system is composed of several parts, and it can only be used again in the mission if all broken parts are replaced. Due to the stochastic nature of the problem, we generate scenarios that simulate the failure of the parts. The backbone of TOPSPIN is a mixed-integer linear program that determines an optimal, scenario-robust mix of spare parts. Using input data provided by the German Logistikzentrum (RealData.xlsx), we analyze how many scenarios need to be generated in order to determine reliable solutions. A further data set (SimData.xlsx) was generated with random data, having a similar structure as the real data set. Using these two data sets, we analyze the composition of the warehouse over a variety of different weight restrictions, and we examine the number of repairable systems for different values of this bound. </p>
A Binary Integer Programming-based Method for Qubit Mapping in Sparse Architectures
<p>Qubit Mapping Based on MIP</p>
Accurate Flow Decomposition via Robust Integer Linear Programming
<p>Dataset created using Poisson distribution to generate imperfect flow .</p> <p>March 2024 - Update: It contains the original graph, the ground truth and the imperfect flow used for inexact and robust flow decompositions.</p>
Attack time analysis in dynamic attack trees via integer linear programming
<p>Matlab code for the experiments of the paper "Attack time analysis in dynamic attack trees via integer linear programming" by Milan Lopuhaä-Zwakenberg & Mariëlle Stoelinga.</p> <p>The code can be accessed either via the virtual machine in Artifact_MILPforDATs_revised.zip, or through the code directly in Matlab_code.zip. The results are in Paper_results.zip.</p> <p>To run the code, installations of Matlab and Gurobi are required.</p>
Fast and Regularized Reconstruction of Building Facades from Street-View Images using Binary Integer Programming
<p>Video demonstrations of the paper "Fast and Regularized Reconstruction of Building Facades from Street-View Images using Binary Integer Programming".</p>
Lpnet: Reconstructing phylogenetic networks from distances using integer linear programming
<p>We present Lpnet, a variant of the widely used Neighbor-net method that approximates pairwise distances between taxa by a circular phylogenetic network. We first apply standard methods to construct a binary phylogenetic tree and then use integer linear programming to compute optimal circular orderings that agree with all tree splits. This approach achieves an improved approximation of the input distance for the clear majority of experiments that we have run for simulated and real data. We release an implementation in R that can handle up to 94 taxa and usually needs about one minute on a standard computer for 80 taxa. For larger taxa sets, we include a top-down heuristic which also tends to perform better than Neighbor-net.</p>
Attack time analysis in dynamic attack trees via integer linear programming
<p>Code and data corresponding to the paper "Attack time analysis in dynamic attack trees via integer linear programming"</p>
Lpnet: Reconstructing phylogenetic networks from distances using integer linear programming
Open the record for dataset details and reuse information.
Experimental Repository for "Learn to Relax: Integrating 0-1 Integer Linear Programming with Pseudo-Boolean Conflict-Driven Search"
<p># Learn to Relax: Integrating 0-1 Integer Linear Programming with Pseudo-Boolean Conflict-Driven Search</p> <p>Experimental repository.</p> <p>Directory structure:</p> <p>- binary: contains the statically compiled RoundingSat binary used for the experiments.<br> - data: contains raw .csv data files of the experiments.<br> - plots: contains the plots in the paper, as well as additional ones.</p>
Dataset for 'An integer programming model for the selection of pumped-hydro storage projects'
<p>Dataset for 'An integer programming model for the selection of pumped-hydro storage projects' paper<br> <br> The dataset has 2 files:</p> <ul> <li>266_elev.txt</li> <li>table_h_p_ct.csv <ul> <li>The columns are, respectively, height (m), power (MW), and cost (USD/kW)</li> </ul> </li> </ul>
ScienceDex guides
Understand access before you commit
These curated guides explain access requirements, typical timelines, costs, and reuse considerations for widely used research datasets.
Allen Brain Atlas
Allen Brain Atlas is an Allen Institute collection of brain map atlases, datasets, APIs, and analysis tools covering mouse, human, and non-human primate brain resources.
Annotated Behaviour and Observability Dataset (ABODe)
ABODe is a University of Edinburgh DataShare dataset for behavior classification in group-housed mice using home-cage video, identities, bounding boxes, ground-plate positions, and annotator labels.
DANDI Archive for NWB datasets
DANDI is a BRAIN Initiative archive for publishing and sharing neurophysiology data, including electrophysiology, optophysiology, and behavioral data packaged as NWB and related standards.
International Brain Laboratory public data
The International Brain Laboratory public data releases expose standardized mouse decision-making experiments, including Neuropixels recordings, widefield calcium imaging, behavior, and session metadata accessed through the ONE API.
OpenNeuro
OpenNeuro is a free, open platform for sharing neuroimaging datasets, with public search, dataset pages, and download paths for web, S3, DataLad, and the OpenNeuro CLI.