Constarium
← Search

Data · dataset · 2025

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

Listed in IISH Dataverse

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.

Links

Where it is published

Catalogue records · 1

Topics

Stated by source
Mathematical Sciences
Provenance · 1 source records, 9 field assertions
SourceKeyLast seenRaw
IISH Dataversedoi:10.34894/MBIOH011 d agoJSON v1
FieldAssertionExtractorEvidence
concepts[field].anzsrc:field:490404enrichment · datasets iisg amsterdamtaxonomy-embedding@1.1.0title+keywords+description (77%)
concepts[field].dataverse_subject:mathematical-sciencessource · datasets iisg amsterdamconnector:datasets_iisg_amsterdam@1.0.0/subjects
concepts[field].local:field:mathematics-statisticsmapping · datasets iisg amsterdamconnector:datasets_iisg_amsterdam@1.0.0/subjects
created_datesource · datasets iisg amsterdamconnector:datasets_iisg_amsterdam@1.0.0
descriptionsource · datasets iisg amsterdamconnector:datasets_iisg_amsterdam@1.0.0/description
publication_datesource · datasets iisg amsterdamconnector:datasets_iisg_amsterdam@1.0.0
titlesource · datasets iisg amsterdamconnector:datasets_iisg_amsterdam@1.0.0/name
updated_datesource · datasets iisg amsterdamconnector:datasets_iisg_amsterdam@1.0.0
version_labelsource · datasets iisg amsterdamconnector:datasets_iisg_amsterdam@1.0.0