New upper bounds for some instances from benchmark for vector packing problem

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 consists of 14 solutions with better bounds for instances described in paper: Heßler, 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: solut…