Data for "Analysis of Power in Preprocessing Methodologies for Datasets with Missing Values"
Description
Results generated by the CPLEX branch-and-bound algorithm. The first column indicates the benchmark instance name, while the second column denotes the MIP emphasis switch. The third and fourth columns respectively give the number of columns and rows in the linear programming problem associated with the instance. The fifth and sixth columns present the dual and the primal values obtained by the CPLEX branch-and-bound, which were employed to compute the optimality gap reported in the seventh column. The eighth column states the final status of the algorithm. Finally, the last column gives the number of nodes evaluated in the branch-and-bound tree. The status of the algorithm may be "Unknown", "Feasible", or "Optimal". Unknown refers to the run that did not find a result. Therefore, it indicates missing data. Feasible refers to instances with a non-optimal solution that ended in 60 seconds. Optimal are those instances with an optimal value within the 60 seconds time span. In our original analysis, we rounded the time of all instances with a "Feasible" status to 60 seconds