Build (method = -2) #dp: 22120 Step-3' Graph: 709 vertices and 4338 arcs (0.13s) Step-4' Graph: 632 vertices and 4189 arcs (0.13s) #V4/#V3 = 0.89 #A4/#A3 = 0.97 Ready! (0.13s) Optimize a model with 652 rows, 4190 columns and 11312 nonzeros Presolve removed 34 rows and 66 columns Presolve time: 0.05s Presolved: 618 rows, 4124 columns, 11251 nonzeros Variable types: 0 continuous, 4124 integer (0 binary) Found heuristic solution: objective 186.0000000 Optimize a model with 618 rows, 4124 columns and 11251 nonzeros Presolved: 618 rows, 4124 columns, 11251 nonzeros Root barrier log... Ordering time: 0.01s Barrier statistics: AA' NZ : 7.141e+03 Factor NZ : 3.598e+04 (roughly 2 MBytes of memory) Factor Ops : 3.258e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.71045425e+03 -8.99275732e+04 1.59e+05 2.22e-16 1.96e+02 0s 1 9.14609135e+02 -5.49596764e+04 1.72e+04 2.22e-15 2.54e+01 0s 2 4.49385035e+02 -2.19172768e+04 5.00e+03 1.55e-15 7.40e+00 0s 3 2.62938627e+02 -7.10274970e+03 1.23e+03 4.44e-15 1.86e+00 0s 4 2.14282702e+02 -3.04523861e+03 2.92e+02 6.22e-15 5.84e-01 0s 5 1.99187917e+02 -8.80693550e+02 1.45e+00 3.77e-15 1.31e-01 0s 6 1.95672756e+02 -4.22142133e+02 2.30e-03 2.11e-15 7.47e-02 0s 7 1.75763037e+02 -3.61496169e+02 1.95e-03 1.89e-15 6.50e-02 0s 8 1.28589466e+02 -1.45035218e+02 1.36e-03 6.87e-16 3.31e-02 0s 9 7.10321859e+01 -6.25664886e+01 5.95e-04 6.92e-16 1.62e-02 0s 10 6.82986992e+01 -5.16001816e+01 5.67e-04 8.17e-16 1.45e-02 0s 11 5.33660708e+01 -2.86129943e+01 4.19e-04 8.22e-16 9.92e-03 0s 12 4.38399769e+01 -1.68492112e+01 3.10e-04 7.97e-16 7.34e-03 0s 13 3.88409143e+01 6.91754480e+00 2.08e-04 6.21e-16 3.86e-03 0s 14 3.15334148e+01 1.40445918e+01 1.02e-04 6.68e-16 2.12e-03 0s 15 3.11658473e+01 1.72013542e+01 9.53e-05 7.81e-16 1.69e-03 0s 16 2.62677406e+01 2.07728836e+01 2.83e-05 6.26e-16 6.65e-04 0s 17 2.59648872e+01 2.26252858e+01 2.03e-05 6.94e-16 4.04e-04 0s 18 2.61724345e+01 2.29851348e+01 1.89e-05 8.97e-16 3.85e-04 0s 19 2.52523046e+01 2.45748357e+01 3.81e-06 5.55e-16 8.19e-05 0s 20 2.50021766e+01 2.49788965e+01 2.09e-12 5.26e-16 2.82e-06 0s 21 2.50000022e+01 2.49999789e+01 2.51e-12 4.79e-16 2.82e-09 0s 22 2.50000000e+01 2.50000000e+01 4.79e-13 4.38e-16 2.98e-15 0s Barrier solved model in 22 iterations and 0.11 seconds Optimal objective 2.50000000e+01 Root relaxation: objective 2.500000e+01, 2854 iterations, 0.15 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 25.00000 0 72 186.00000 25.00000 86.6% - 0s H 0 0 26.0000000 25.00000 3.85% - 0s H 0 0 25.0000000 25.00000 0.0% - 0s Explored 0 nodes (5222 simplex iterations) in 0.65 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.500000000000e+01, best bound 2.500000000000e+01, gap 0.0% Preprocessing time: 0.15 seconds Gurobi run time: 0.65 seconds Total run time: 0.80 seconds Objective: 25 Solution: 3 x [2, 2, 7, 13, 15, 16, 17, 18] 1 x [2, 4, 6, 13, 14, 15, 17, 18] 1 x [1, 5, 6, 14, 14, 15, 15, 18] 1 x [2, 8, 8, 8, 12, 18, 19, 19] 5 x [3, 12, 13, 17, 18, 19, 19, 20] 2 x [2, 4, 10, 14, 14, 14, 18, 18] 1 x [3, 10, 13, 14, 17, 18, 18, 18] 1 x [7, 7, 8, 8, 8, 12, 15, 19] 1 x [2, 7, 10, 11, 13, 14, 15, 17] 3 x [2, 7, 8, 8, 8, 11, 11, 15] 1 x [5, 10, 11, 11, 13, 15, 20, 20] 1 x [9, 10, 10, 10, 13, 14, 15, 19] 1 x [7, 9, 10, 10, 10, 10, 13, 14] 1 x [2, 3, 10, 10, 10, 13, 17, 20] 1 x [1, 3, 10, 14, 14, 19, 19, 19] 1 x [3, 3, 3, 3, 4, 6, 14, 20]