Detailed numerical results for "Solving robust bin packing problems with a branch-and-price approach"
Published: 2 December 2020| Version 1 | DOI: 10.17632/sb546ktftv.1
They include for each instance the following columns : meth, group, instance, radius, uncertains, time, dual bound, primal bound, nodes. Column meth provides the robust approach. Column group gives the instance group. Column instance contains the instance name. Column radius provides either the multiplier of W in the case of a stability-radius based approach, or the relative resiliency. Column uncertains gives the percent of uncertain-size items. Column time contains the solving time in seconds. Column dual bound provides the best dual bound at the end of the optimization process. Column primal bound gives the best primal bound at the end of the optimization process. Column nodes contains the number of nodes in the search tree.