数据链接：
官方服务：
资源简介：
Results for the Fragmentable Items Bin Packing Problem
应用场景：
创建时间：
2016-06-07
相关数据集
GSet Dataset
The objective of the max-cut problem is to cut any graph in such a way that the total weight of the edges that are cut off is maximum in both subsets of vertices that are divided due to the cut of the
DataCite Commons2024-04-18 更新3130
I.AM. Archive containing experiments of a UR10 with vacuum gripper flipping and stacking boxes in a container for sequence 1
I.AM. dataset as part of the Impact-Aware Robotics Database. This dataset contains recordings of experiments with a robotic arm (UR10) that is manipulating various objects that arrive at a conveyor be
DataCite Commons2024-09-12 更新120
Replication Data for: Improved guarantees for the a priori TSP
Dual linear programming solutions and Python scripts that verify their feasibility. The dual linear programs for which feasible solutions are provided can be found in the provided README files. The li
bonndata2023-09-20 更新40
Enhancing portfolio optimization with multi-LLM sentiment aggregation: A Black-Litterman integration approach
Sentiment analysis of financial text data plays a crucial role in investment decisionmaking, yet existing approaches often rely on single-model sentiment scores that may suffer from biases or hallucin
DataCite Commons2025-08-14 更新180
A Factor-Based Estimation of Integrated Covariance Matrix With Noisy High-Frequency Data
This article studies a high-dimensional factor model with sparse idiosyncratic covariance matrix in continuous time, using asynchronous high-frequency financial data contaminated by microstructure noi
NIAID Data Ecosystem110
