{"status":"OK","data":{"id":497013,"identifier":"MBIOH0","persistentUrl":"https://doi.org/10.34894/MBIOH0","protocol":"doi","authority":"10.34894","separator":"/","publisher":"DataverseNL","publicationDate":"2025-08-25","storageIdentifier":"surf://10.34894/MBIOH0","effectiveDatasetFileCountLimit":10000,"datasetFileUploadsAvailable":9985,"datasetType":"dataset","locks":[],"latestVersion":{"id":31063,"datasetId":497013,"datasetPersistentId":"doi:10.34894/MBIOH0","datasetType":"dataset","storageIdentifier":"surf://10.34894/MBIOH0","versionNumber":1,"internalVersionNumber":11,"versionMinorNumber":0,"versionState":"RELEASED","latestVersionPublishingState":"RELEASED","deaccessionLink":"","lastUpdateTime":"2025-08-25T07:35:15Z","releaseTime":"2025-08-25T07:35:15Z","createTime":"2025-08-07T08:51:49Z","publicationDate":"2025-08-25","citationDate":"2025-08-25","effectiveDatasetFileCountLimit":10000,"datasetFileUploadsAvailable":9985,"license":{"name":"CC-BY-4.0","uri":"http://creativecommons.org/licenses/by/4.0","iconUri":"https://i.creativecommons.org/l/by/4.0/88x31.png"},"fileAccessRequest":false,"metadataBlocks":{"citation":{"displayName":"Citation Metadata","name":"citation","fields":[{"typeName":"title","multiple":false,"typeClass":"primitive","value":"Replication Data for \"Bounds and heuristic algorithms for the bin packing problem with minimum color fragmentation\""},{"typeName":"author","multiple":true,"typeClass":"compound","value":[{"authorName":{"typeName":"authorName","multiple":false,"typeClass":"primitive","value":"Barkel, Mathijs"},"authorAffiliation":{"typeName":"authorAffiliation","multiple":false,"typeClass":"primitive","value":"https://ror.org/04b8v1s79","expandedvalue":{"scheme":"http://www.grid.ac/ontology/","termName":"Tilburg University","@type":"https://schema.org/Organization"}},"authorIdentifierScheme":{"typeName":"authorIdentifierScheme","multiple":false,"typeClass":"controlledVocabulary","value":"ORCID"},"authorIdentifier":{"typeName":"authorIdentifier","multiple":false,"typeClass":"primitive","value":"0000-0003-1276-588X"}},{"authorName":{"typeName":"authorName","multiple":false,"typeClass":"primitive","value":"Delorme, Maxence"},"authorAffiliation":{"typeName":"authorAffiliation","multiple":false,"typeClass":"primitive","value":"https://ror.org/04b8v1s79","expandedvalue":{"scheme":"http://www.grid.ac/ontology/","termName":"Tilburg University","@type":"https://schema.org/Organization"}},"authorIdentifierScheme":{"typeName":"authorIdentifierScheme","multiple":false,"typeClass":"controlledVocabulary","value":"ORCID"},"authorIdentifier":{"typeName":"authorIdentifier","multiple":false,"typeClass":"primitive","value":"0000-0003-3730-0894"}}]},{"typeName":"datasetContact","multiple":true,"typeClass":"compound","value":[{"datasetContactName":{"typeName":"datasetContactName","multiple":false,"typeClass":"primitive","value":"TiU Dataverse Admins"},"datasetContactAffiliation":{"typeName":"datasetContactAffiliation","multiple":false,"typeClass":"primitive","value":"Tilburg University"}}]},{"typeName":"dsDescription","multiple":true,"typeClass":"compound","value":[{"dsDescriptionValue":{"typeName":"dsDescriptionValue","multiple":false,"typeClass":"primitive","value":"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."}}]},{"typeName":"subject","multiple":true,"typeClass":"controlledVocabulary","value":["Mathematical Sciences"]},{"typeName":"keyword","multiple":true,"typeClass":"compound","value":[{"keywordValue":{"typeName":"keywordValue","multiple":false,"typeClass":"primitive","value":"Color fragmentation"}},{"keywordValue":{"typeName":"keywordValue","multiple":false,"typeClass":"primitive","value":"Computational experiments"}},{"keywordValue":{"typeName":"keywordValue","multiple":false,"typeClass":"primitive","value":"Lower bounds"}},{"keywordValue":{"typeName":"keywordValue","multiple":false,"typeClass":"primitive","value":"Packing"}},{"keywordValue":{"typeName":"keywordValue","multiple":false,"typeClass":"primitive","value":"Tabu search"}}]},{"typeName":"publication","multiple":true,"typeClass":"compound","value":[{"publicationCitation":{"typeName":"publicationCitation","multiple":false,"typeClass":"primitive","value":"Mathijs Barkel, Maxence Delorme, Enrico Malaguti, Michele Monaci,\nBounds and heuristic algorithms for the bin packing problem with minimum color fragmentation, European Journal of Operational Research, Volume 320, Issue 1,\n2025, Pages 57-68, ISSN 0377-2217"},"publicationIDType":{"typeName":"publicationIDType","multiple":false,"typeClass":"controlledVocabulary","value":"doi"},"publicationIDNumber":{"typeName":"publicationIDNumber","multiple":false,"typeClass":"primitive","value":"10.1016/j.ejor.2024.08.007"},"publicationURL":{"typeName":"publicationURL","multiple":false,"typeClass":"primitive","value":"https://doi.org/10.1016/j.ejor.2024.08.007"}}]},{"typeName":"producer","multiple":true,"typeClass":"compound","value":[{"producerName":{"typeName":"producerName","multiple":false,"typeClass":"primitive","value":"Tilburg University"}}]},{"typeName":"distributor","multiple":true,"typeClass":"compound","value":[{"distributorName":{"typeName":"distributorName","multiple":false,"typeClass":"primitive","value":"DataverseNL"}}]},{"typeName":"depositor","multiple":false,"typeClass":"primitive","value":"Takahashi, Mio"},{"typeName":"dateOfDeposit","multiple":false,"typeClass":"primitive","value":"2025-08-07"}]},"dansDataVaultMetadata":{"displayName":"Data Vault Metadata","name":"dansDataVaultMetadata","fields":[{"typeName":"dansDataversePid","multiple":false,"typeClass":"primitive","value":"doi:10.34894/MBIOH0"},{"typeName":"dansDataversePidVersion","multiple":false,"typeClass":"primitive","value":"1.0"},{"typeName":"dansBagId","multiple":false,"typeClass":"primitive","value":"urn:uuid:6c94802d-46e0-4729-aeb1-d0b2c27cef0d"},{"typeName":"dansNbn","multiple":false,"typeClass":"primitive","value":"urn:nbn:nl:ui:13-da82383a-450e-4ee9-ba93-39bc58dc2ba4"}]}},"files":[{"label":"AFCSP.cpp","restricted":false,"directoryLabel":"BPPMCF-main","version":1,"datasetVersionId":31063,"dataFile":{"id":497026,"persistentId":"","filename":"AFCSP.cpp","contentType":"text/x-c","friendlyType":"C++ Source","filesize":28580,"storageIdentifier":"surf://store:19883b7cf74-b00b29b591ff","rootDataFileId":-1,"checksum":{"type":"SHA-1","value":"a5e11aca558140250129664606d89769112006d1"},"tabularData":false,"creationDate":"2025-08-07","publicationDate":"2025-08-25","directoryLabel":"BPPMCF-main","lastUpdateTime":"2025-08-25T07:35:15Z","fileAccessRequest":false}},{"label":"AFCSP.h","restricted":false,"directoryLabel":"BPPMCF-main","version":1,"datasetVersionId":31063,"dataFile":{"id":497025,"persistentId":"","filename":"AFCSP.h","contentType":"text/x-c","friendlyType":"C++ Source","filesize":755,"storageIdentifier":"surf://store:19883b7cf7b-809bd2b1a193","rootDataFileId":-1,"checksum":{"type":"SHA-1","value":"c2bf0ab68983ee9163e58fc6789fc1fbc668ef99"},"tabularData":false,"creationDate":"2025-08-07","publicationDate":"2025-08-25","directoryLabel":"BPPMCF-main","lastUpdateTime":"2025-08-25T07:35:15Z","fileAccessRequest":false}},{"label":"Best LBs and UBs.xlsx","restricted":false,"directoryLabel":"BPPMCF-main","version":1,"datasetVersionId":31063,"dataFile":{"id":497017,"persistentId":"","filename":"Best LBs and UBs.xlsx","contentType":"application/vnd.openxmlformats-officedocument.spreadsheetml.sheet","friendlyType":"MS Excel Spreadsheet","filesize":28842,"storageIdentifier":"surf://store:19883b7cf9b-727499a3ce2d","rootDataFileId":-1,"checksum":{"type":"SHA-1","value":"aeeac496ef4c8c8729c192ef30f6d4ace61b13ad"},"tabularData":false,"creationDate":"2025-08-07","publicationDate":"2025-08-25","directoryLabel":"BPPMCF-main","lastUpdateTime":"2025-08-25T07:35:15Z","fileAccessRequest":false}},{"label":"BPPLB.cpp","restricted":false,"directoryLabel":"BPPMCF-main","version":1,"datasetVersionId":31063,"dataFile":{"id":497024,"persistentId":"","filename":"BPPLB.cpp","contentType":"text/x-c","friendlyType":"C++ Source","filesize":6649,"storageIdentifier":"surf://store:19883b7cf81-ea314c74accd","rootDataFileId":-1,"checksum":{"type":"SHA-1","value":"414ada2b45bed63de779ed58b253c09d97997469"},"tabularData":false,"creationDate":"2025-08-07","publicationDate":"2025-08-25","directoryLabel":"BPPMCF-main","lastUpdateTime":"2025-08-25T07:35:15Z","fileAccessRequest":false}},{"label":"BPPLB.h","restricted":false,"directoryLabel":"BPPMCF-main","version":1,"datasetVersionId":31063,"dataFile":{"id":497014,"persistentId":"","filename":"BPPLB.h","contentType":"text/x-c","friendlyType":"C++ Source","filesize":209,"storageIdentifier":"surf://store:19883b7cf87-808af609b0bf","rootDataFileId":-1,"checksum":{"type":"SHA-1","value":"b47f9d5570cd2c042c390533de709ef51273b251"},"tabularData":false,"creationDate":"2025-08-07","publicationDate":"2025-08-25","directoryLabel":"BPPMCF-main","lastUpdateTime":"2025-08-25T07:35:15Z","fileAccessRequest":false}},{"label":"BPPUB.cpp","restricted":false,"directoryLabel":"BPPMCF-main","version":1,"datasetVersionId":31063,"dataFile":{"id":497022,"persistentId":"","filename":"BPPUB.cpp","contentType":"text/x-c","friendlyType":"C++ Source","filesize":21000,"storageIdentifier":"surf://store:19883b7cf8e-ce0fe8c4d04a","rootDataFileId":-1,"checksum":{"type":"SHA-1","value":"841c02c4de92782e18083a80bd47a47cacf0ff90"},"tabularData":false,"creationDate":"2025-08-07","publicationDate":"2025-08-25","directoryLabel":"BPPMCF-main","lastUpdateTime":"2025-08-25T07:35:15Z","fileAccessRequest":false}},{"label":"BPPUB.h","restricted":false,"directoryLabel":"BPPMCF-main","version":1,"datasetVersionId":31063,"dataFile":{"id":497015,"persistentId":"","filename":"BPPUB.h","contentType":"text/x-c","friendlyType":"C++ Source","filesize":322,"storageIdentifier":"surf://store:19883b7cf97-554eac6d9be6","rootDataFileId":-1,"checksum":{"type":"SHA-1","value":"27e2c833a5c9a4e1383c0ee4c1d1c431bf3aaee5"},"tabularData":false,"creationDate":"2025-08-07","publicationDate":"2025-08-25","directoryLabel":"BPPMCF-main","lastUpdateTime":"2025-08-25T07:35:15Z","fileAccessRequest":false}},{"label":"helper_functions.cpp","restricted":false,"directoryLabel":"BPPMCF-main","version":1,"datasetVersionId":31063,"dataFile":{"id":497018,"persistentId":"","filename":"helper_functions.cpp","contentType":"text/x-c","friendlyType":"C++ Source","filesize":23881,"storageIdentifier":"surf://store:19883b7cfca-a48d43284a89","rootDataFileId":-1,"checksum":{"type":"SHA-1","value":"2de6d92acaca3cc8978469cd09a5374b5d4a8a0b"},"tabularData":false,"creationDate":"2025-08-07","publicationDate":"2025-08-25","directoryLabel":"BPPMCF-main","lastUpdateTime":"2025-08-25T07:35:15Z","fileAccessRequest":false}},{"label":"helper_functions.h","restricted":false,"directoryLabel":"BPPMCF-main","version":1,"datasetVersionId":31063,"dataFile":{"id":497019,"persistentId":"","filename":"helper_functions.h","contentType":"text/x-c","friendlyType":"C++ Source","filesize":2922,"storageIdentifier":"surf://store:19883b7cfd0-645c13894caf","rootDataFileId":-1,"checksum":{"type":"SHA-1","value":"e9ae75b65e4034eae7afe188b449676eb3db81f0"},"tabularData":false,"creationDate":"2025-08-07","publicationDate":"2025-08-25","directoryLabel":"BPPMCF-main","lastUpdateTime":"2025-08-25T07:35:15Z","fileAccessRequest":false}},{"label":"InstancesBPPMCF.zip","restricted":false,"directoryLabel":"BPPMCF-main","version":1,"datasetVersionId":31063,"dataFile":{"id":497023,"persistentId":"","filename":"InstancesBPPMCF.zip","contentType":"application/zip","friendlyType":"ZIP Archive","filesize":487716,"storageIdentifier":"surf://store:19883b7cfa0-74ad8f014dc7","rootDataFileId":-1,"checksum":{"type":"SHA-1","value":"ea5d4cb79fe3e67646b4e08fb1699683940a8935"},"tabularData":false,"creationDate":"2025-08-07","publicationDate":"2025-08-25","directoryLabel":"BPPMCF-main","lastUpdateTime":"2025-08-25T07:35:15Z","fileAccessRequest":false}},{"label":"main.cpp","restricted":false,"directoryLabel":"BPPMCF-main","version":1,"datasetVersionId":31063,"dataFile":{"id":497028,"persistentId":"","filename":"main.cpp","contentType":"text/x-c","friendlyType":"C++ Source","filesize":2497,"storageIdentifier":"surf://store:19883b7cfd6-2ca6e1ac7195","rootDataFileId":-1,"checksum":{"type":"SHA-1","value":"c886e98154ec744df20c7a1e3f7beff2a9045d68"},"tabularData":false,"creationDate":"2025-08-07","publicationDate":"2025-08-25","directoryLabel":"BPPMCF-main","lastUpdateTime":"2025-08-25T07:35:15Z","fileAccessRequest":false}},{"label":"main.h","restricted":false,"directoryLabel":"BPPMCF-main","version":1,"datasetVersionId":31063,"dataFile":{"id":497016,"persistentId":"","filename":"main.h","contentType":"text/x-c","friendlyType":"C++ Source","filesize":147,"storageIdentifier":"surf://store:19883b7cfdd-73217bb09be5","rootDataFileId":-1,"checksum":{"type":"SHA-1","value":"ee4d6d8ddb8ed85a801144c735cbbadabe13c976"},"tabularData":false,"creationDate":"2025-08-07","publicationDate":"2025-08-25","directoryLabel":"BPPMCF-main","lastUpdateTime":"2025-08-25T07:35:15Z","fileAccessRequest":false}},{"label":"README.txt","restricted":false,"directoryLabel":"BPPMCF-main","version":1,"datasetVersionId":31063,"dataFile":{"id":497021,"persistentId":"","filename":"README.txt","contentType":"text/plain","friendlyType":"Plain Text","filesize":3175,"storageIdentifier":"surf://store:19883b7cfb0-e8fd5f6ba292","rootDataFileId":-1,"checksum":{"type":"SHA-1","value":"cf465d55f2f0b3955e77d0fda1394aa3c0c55df9"},"tabularData":false,"creationDate":"2025-08-07","publicationDate":"2025-08-25","directoryLabel":"BPPMCF-main","lastUpdateTime":"2025-08-25T07:35:15Z","fileAccessRequest":false}},{"label":"TS.cpp","restricted":false,"directoryLabel":"BPPMCF-main","version":1,"datasetVersionId":31063,"dataFile":{"id":497027,"persistentId":"","filename":"TS.cpp","contentType":"text/x-c","friendlyType":"C++ Source","filesize":50193,"storageIdentifier":"surf://store:19883b7cfb8-a02ceeca182f","rootDataFileId":-1,"checksum":{"type":"SHA-1","value":"5a8db60cda0c8f54b427d3b60c355caf44ba53a1"},"tabularData":false,"creationDate":"2025-08-07","publicationDate":"2025-08-25","directoryLabel":"BPPMCF-main","lastUpdateTime":"2025-08-25T07:35:15Z","fileAccessRequest":false}},{"label":"TS.h","restricted":false,"directoryLabel":"BPPMCF-main","version":1,"datasetVersionId":31063,"dataFile":{"id":497020,"persistentId":"","filename":"TS.h","contentType":"text/x-c","friendlyType":"C++ Source","filesize":1235,"storageIdentifier":"surf://store:19883b7cfc1-5635a0c15d38","rootDataFileId":-1,"checksum":{"type":"SHA-1","value":"e0e9e5be3e210b039c46dd074956fd6d3eb9d106"},"tabularData":false,"creationDate":"2025-08-07","publicationDate":"2025-08-25","directoryLabel":"BPPMCF-main","lastUpdateTime":"2025-08-25T07:35:15Z","fileAccessRequest":false}}]}}}