Build (method = -2) #dp: 25968 Step-3' Graph: 411 vertices and 3919 arcs (0.23s) Step-4' Graph: 294 vertices and 3686 arcs (0.23s) #V4/#V3 = 0.72 #A4/#A3 = 0.94 Ready! (0.23s) Optimize a model with 336 rows, 3687 columns and 10477 nonzeros Presolve removed 21 rows and 28 columns Presolve time: 0.08s Presolved: 315 rows, 3659 columns, 10507 nonzeros Variable types: 0 continuous, 3659 integer (2613 binary) Found heuristic solution: objective 39.0000000 Optimize a model with 315 rows, 3659 columns and 10507 nonzeros Presolve removed 1 rows and 1 columns Presolved: 314 rows, 3658 columns, 10507 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 6.187e+03 Factor NZ : 1.784e+04 (roughly 2 MBytes of memory) Factor Ops : 1.308e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.77503141e+03 -1.76704935e+04 4.03e+04 2.07e-01 1.96e+01 0s 1 7.52975525e+02 -4.94886077e+03 9.92e+03 7.22e-16 4.72e+00 0s 2 1.75572262e+02 -1.71844110e+03 1.43e+03 6.66e-16 7.95e-01 0s 3 6.86887995e+01 -3.66890278e+02 1.71e+02 6.66e-16 1.18e-01 0s 4 3.23305924e+01 -9.26665761e+01 3.48e+01 4.58e-16 2.80e-02 0s 5 2.03436912e+01 -3.61473483e+01 1.31e+01 4.93e-16 1.12e-02 0s 6 1.58584369e+01 -1.94078060e+01 7.78e+00 4.79e-16 6.61e-03 0s 7 1.29152806e+01 -9.07138470e+00 5.23e+00 3.75e-16 4.03e-03 0s 8 1.00467778e+01 -9.34522246e-01 2.71e+00 3.30e-16 1.89e-03 0s 9 9.18279758e+00 2.43144251e+00 1.54e+00 3.56e-16 1.10e-03 0s 10 8.66047659e+00 6.77818931e+00 1.74e-01 2.59e-16 2.67e-04 0s 11 8.35636053e+00 8.18566423e+00 2.67e-04 2.77e-16 2.33e-05 0s 12 8.33335429e+00 8.33316258e+00 2.55e-08 2.58e-16 2.62e-08 0s 13 8.33333333e+00 8.33333333e+00 3.77e-14 3.33e-16 2.65e-14 0s Barrier solved model in 13 iterations and 0.06 seconds Optimal objective 8.33333333e+00 Root relaxation: objective 8.333333e+00, 2481 iterations, 0.10 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 8.33333 0 13 39.00000 8.33333 78.6% - 0s H 0 0 9.0000000 8.33333 7.41% - 0s Explored 0 nodes (5175 simplex iterations) in 0.51 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 9.000000000000e+00, best bound 9.000000000000e+00, gap 0.0% Preprocessing time: 0.25 seconds Gurobi run time: 0.51 seconds Total run time: 0.76 seconds Objective: 9 Solution: 1 x [2, 11, 26, 27, 38, 41] 1 x [4, 15, 18, 23, 25, 36] 1 x [4, 18, 39, 40] 1 x [8, 10, 13, 16, 24, 30] 1 x [9, 12, 21, 21, 22, 29] 1 x [10, 14, 16, 17, 20, 25] 1 x [6, 7, 19, 32, 36] 1 x [5, 26, 28, 34, 37, 42] 1 x [1, 3, 31, 33, 35]