官方服务：
资源简介：
Dataset for the Resource Constrained Clustered Shortest Path Tree Problem.
应用场景：
创建时间：
2022-08-29
相关数据集
IEEEXtreme 13: Minimum Permutation
This dataset contains a total of 11875 submissions, with 8% correct solutions and 61% partial solutions. Link to the original challenge: https://csacademy.com/ieeextreme-practice/task/minimum-permutat
DataCite Commons2024-02-28 更新80
Software Open Access Maximal-Sum Submatrix search using a hybrid Contraint Programming/Linear Programming approach: experiment code and results
Experiments (made with Snakemake) code & results for the paper " Software Open Access Maximal-Sum Submatrix search using a hybrid Contraint Programming/Linear Programming approach" under review at
Zenodo2021-03-08 更新20
Enumeration Approach to Atom-to-Atom Mapping Accelerated by Ising Computing
Chemical reactions are regarded as transformations of chemical structures, and the question of which atoms in the reactants correspond to which atoms in the products has attracted chemists for a long
NIAID Data Ecosystem10
Instances of "The Capacitated Family Traveling Salesperson Problem"
Instances of the "The Capacitated Family Traveling Salesperson Problem". Abstract: This paper addresses the Capacitated Family Traveling Salesperson Problem (CFTSP), a variant of the Family Traveling
Figshare2023-11-09 更新20
Complete Forcing Numbers of Random Multiple Hexagonal Chains
Let G be a simple connected graph with vertex set V(G) and edge set E(G) that admits a perfect matching M. A forcing set of M is a subset of M contained in no other perfect matchings of G. The minimum
NIAID Data Ecosystem20
