首页/数据集/BP Instances from QD methods

BP Instances from QD methods

Mendeley Data2026-04-18 收录

装箱问题优化

组合优化实例

数据链接：

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

官方服务：

资源简介：

Bin Packing problem instances for N = 120. The dataset includes the target solver and the generation method employed to produce such instance.

应用场景：

创建时间：

2026-04-17

装箱问题优化

并发搜索算法评估

Results and statistical tests for one-, two- and three-dimensional bin packing problems comparing concurrent bi-space search (CBS) against single-space heuristic and solution searches. This research

DataCite Commons2024-07-19 更新60

Replication Data for "Bounds and heuristic algorithms for the bin packing problem with minimum color fragmentation"

装箱问题优化

颜色碎片化

This repository contains the tested instances and code for all algorithms discussed in the paper "Bounds and Heuristic Algorithms for the Bin Packing Problem with Minimum Color Fragmentation" by Mathi

DataverseNL2025-08-25 更新10

On the suitability of solution strategies for classes of graph coloring instances

图着色求解策略

组合优化实例

This thesis was scanned from the print manuscript for digital preservation and is copyright the author. Researchers can access this thesis by asking their local university, institution or public libra

Monash University Figshare2026-02-11 更新10

Solving Large Weighted MaxSAT Problems with StreamMaxSAT (Artifact)

加权MaxSAT求解

组合优化实例

Some MaxSAT instances

NIAID Data Ecosystem50

BP Instances from QD methods

装箱问题优化

组合优化

Bin Packing problem instances for N = 120. The dataset includes the target solver and the generation method employed to produce such instance.

DataCite Commons2026-04-17 更新10