Prize-Collecting Covering Tour Problem

NIAID Data Ecosystem2026-03-10 收录

组合优化

路径规划算法

数据链接：

https://data.mendeley.com/datasets/gpnmh9kdr9 数据链接链接失效反馈

官方服务：

资源简介：

Complete results of mathematical formulations and heuristics for the Prize-Collecting Covering Tour Problem.

创建时间：

2019-02-03

单片集成光学伊辛机数据集

光学伊辛机

组合优化

对计算能力和能效日益增长的需求推动了光学伊辛机（optical Ising machine）在组合优化问题求解中的发展。然而，现有实现方式在集成密度和能效方面仍面临挑战。本文提出了一种基于光电耦合振荡器的单片集成四自旋伊辛机。该系统集成了定制设计的马赫–曾德尔干涉仪（Mach-Zehnder interferometer，MZI）对称矩阵与高效光电耦合（OEC）非线性单元。OEC 单元具有超紧凑的

国家基础学科公共科学数据中心180

SPICE simulation results for the Number Partitioning Problem using wave computing approach

电路模拟

组合优化

SPICE simulation result of three examples of the Number Partitioning Problem. The data includes the real-time signal received by the halt node at the end of the 1-D chain. Direct Fourier transform can

DataCite Commons2025-02-20 更新100

Portfolio optimization: efficiency analysis

组合优化

效率分析

This article aims to analyze the behavior of a portfolio of assets selected by Data Envelopment Analysis (DEA), optimized by the Sharpe approach, and compare it to portfolios of assets obtained only b

DataCite Commons2022-05-30 更新70

G2 Instances for the Prize-Collecting Generalized MST Problem

组合优化

网络优化

New instances for the Prize-Collecting Generalized Minimum Spanning Tree Problem. Instruction to read the GTP file in Marzo and Ribeiro (2019): https://data.mendeley.com/datasets/vftc7kg6ty/2 Refere

NIAID Data Ecosystem110

PyPortfolioOpt Stock Prices

股票价格

组合优化

Stock Prices Data from PyPortfolioOpt

kaggle2020-04-28 更新80