New upper bounds for some instances from benchmark for vector packing problem (Q6717496)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: New upper bounds for some instances from benchmark for vector packing problem |
Dataset published at Zenodo repository.
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New upper bounds for some instances from benchmark for vector packing problem |
Dataset published at Zenodo repository. |
Statements
This dataset is a result of the research: Đorđe Stakić, Miodrag Živković, Ana Anokić, A Reduced Variable Neighborhood Search Approach to the Heterogeneous Vector Bin Packing Problem,Information Technology and Control, 2021,50(4), 808-826, https://doi.org/10.5755/j01.itc.50.4.29009 Files are given by algorithm described in it. This dataset consistsof 14 solutions with better bounds for instances described in paper:Heler, K., Gschwind, T., Irnich, S. Stabilized branch-and-price algorithms for vector packing problems. European Journal of Operational Research, 2018, 271(2), 401-419. https://doi.org/10.1016/j.ejor.2018.04.047 File structure: Instance name: UB: solution (bins with indices of items) CL_04_100_06: 627 CL_04_100_08: 642 CL_04_200_01: 1293 CL_05_100_06: 314 CL_05_100_08: 321 CL_05_100_10: 327 CL_05_200_02: 627 CL_05_200_03: 633 CL_05_200_04: 630 CL_05_200_05: 632 CL_05_200_06: 627 CL_05_200_07: 634 CL_05_200_08: 635 CL_05_200_10: 632
0 references
29 August 2021
0 references
