Efficient Algorithms for the Group Steiner Tree Problem with Many Groups
收藏NIAID Data Ecosystem2026-05-01 收录
相关数据集
Comparison of the computing efficiency of sixteen methods on four real-world networks.
Each value is the average time in seconds for 100 independent runs.
NIAID Data Ecosystem80
3D Bin Packer
The 3D Bin Packing problem is a classic combinatorial optimization problem that has wide applications in logistics, warehousing, transportation, and many other fields. Its core is to reasonably pack a
RapidAPI2025-11-19 更新60
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
Figshare2020-12-31 更新30
Benchmark Instances and Per-Instance Results for the Hybrid Lagrangian-Decomposition Algorithm on Large-Scale Selective Multiple-Choice Knapsack Problems
Companion dataset for the Hybrid Lagrangian-Decomposition (HLD) algorithm for large-scale Selective Multiple-Choice Knapsack Problems.
Zenodo2026-06-19 更新40
