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

Name: Replication Data for "Bounds and heuristic algorithms for the bin packing problem with minimum color fragmentation"
Creator: Tilburg University
Published: 2025-01-01T00:00:00+08:00

DataverseNL2025-08-25 更新2026-05-11 收录

装箱问题优化

颜色碎片化

数据链接：

https://dataverse.nl/citation?persistentId=doi:10.34894/MBIOH0 数据链接链接失效反馈

官方服务：

资源简介：

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 Mathijs Barkel, Maxence Delorme, Enrico Malaguti and Michele Monaci.

提供机构：

Tilburg University

创建时间：

2025-01-01