Build (method = -2) #dp: 2301 Step-3' Graph: 200 vertices and 908 arcs (0.01s) Step-4' Graph: 136 vertices and 780 arcs (0.01s) #V4/#V3 = 0.68 #A4/#A3 = 0.86 Ready! (0.01s) Optimize a model with 161 rows, 781 columns and 2075 nonzeros Presolve removed 60 rows and 61 columns Presolve time: 0.01s Presolved: 101 rows, 720 columns, 2128 nonzeros Variable types: 0 continuous, 720 integer (591 binary) Found heuristic solution: objective 12.0000000 Optimize a model with 101 rows, 720 columns and 2128 nonzeros Presolved: 101 rows, 720 columns, 2128 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.023e+03 Factor NZ : 2.441e+03 Factor Ops : 7.538e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.29420973e+02 -9.06049959e+02 1.59e+03 1.76e-01 4.32e+00 0s 1 9.52706807e+01 -3.29834958e+02 2.92e+02 3.33e-16 8.87e-01 0s 2 3.38141771e+01 -7.66987042e+01 5.23e+01 5.55e-16 1.66e-01 0s 3 1.29054582e+01 -9.08170838e+00 5.73e+00 2.78e-16 2.39e-02 0s 4 9.04038309e+00 3.79585578e+00 1.93e-01 4.44e-16 3.79e-03 0s 5 8.25330155e+00 5.53687568e+00 5.32e-02 2.22e-16 1.91e-03 0s 6 7.79828147e+00 6.46894349e+00 1.94e-02 4.44e-16 9.31e-04 0s 7 7.47766738e+00 6.80429043e+00 6.41e-03 2.90e-16 4.70e-04 0s 8 7.20896493e+00 6.94364599e+00 5.92e-04 2.94e-06 1.84e-04 0s 9 7.16658475e+00 7.07239493e+00 2.80e-04 2.22e-16 6.55e-05 0s 10 7.13284505e+00 7.12493030e+00 8.13e-06 2.22e-16 5.50e-06 0s 11 7.13043778e+00 7.13042913e+00 2.49e-14 2.22e-16 6.00e-09 0s 12 7.13043479e+00 7.13043478e+00 3.55e-14 2.22e-16 6.00e-12 0s Barrier solved model in 12 iterations and 0.01 seconds Optimal objective 7.13043479e+00 Root relaxation: objective 7.130435e+00, 105 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 7.13043 0 38 12.00000 7.13043 40.6% - 0s H 0 0 10.0000000 7.13043 28.7% - 0s H 0 0 8.0000000 7.13043 10.9% - 0s Explored 0 nodes (229 simplex iterations) in 0.03 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 8.000000000000e+00, best bound 8.000000000000e+00, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.03 seconds Total run time: 0.05 seconds Objective: 8 Solution: 1 x [8, 13, 25] 1 x [9, 10, 24] 1 x [3, 19, 23] 1 x [2, 17] 1 x [11, 16, 20] 1 x [5, 7, 12, 22] 1 x [14, 15, 21] 1 x [1, 4, 6, 18]