five

Colorful Bin Packing Problem Instances

收藏
arXiv2025-09-30 收录
下载链接:
https://gitlab.com/renanfernandofranco/fast-neighborhood-search-heuristics-for-the-colorful-bin-packing-problem
下载链接
链接失效反馈
官方服务:
资源简介:
该数据集包含了用于彩色装箱问题(CBPP)实验的实例,这些实例包括标准装箱问题的改编以及具有特定属性的随机生成实例。数据集被划分为四个类别:改编自BPP实例、具有特定权重的随机实例以及统一着色的实例。其中,BPP实例AI和FalkenauerT已知具有最优解。该任务针对的是彩色装箱问题。

This dataset contains instances for experiments on the Colored Bin Packing Problem (CBPP). These instances include adaptations of the standard Bin Packing Problem (BPP) as well as randomly generated instances with specific attributes. The dataset is divided into four categories: BPP-adapted instances, random instances with specific weights, and uniformly colored instances. Among them, the BPP instances AI and FalkenauerT are known to have optimal solutions. This task targets the Colored Bin Packing Problem.
提供机构:
GitLab
5,000+
优质数据集
54 个
任务类型
进入经典数据集
二维码
社区交流群

面向社区/商业的数据集话题

二维码
科研交流群

面向高校/科研机构的开源数据集话题

数据驱动未来

携手共赢发展

商业合作