Build (method = -2) #dp: 7236 Step-3' Graph: 276 vertices and 821 arcs (0.06s) Step-4' Graph: 83 vertices and 435 arcs (0.06s) #V4/#V3 = 0.30 #A4/#A3 = 0.53 Ready! (0.06s) Optimize a model with 125 rows, 436 columns and 1146 nonzeros Presolve removed 23 rows and 43 columns Presolve time: 0.00s Presolved: 102 rows, 393 columns, 1058 nonzeros Variable types: 0 continuous, 393 integer (51 binary) Found heuristic solution: objective 80.0000000 Found heuristic solution: objective 48.0000000 Optimize a model with 102 rows, 393 columns and 1058 nonzeros Presolved: 102 rows, 393 columns, 1058 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.870e+02 Factor NZ : 9.210e+02 Factor Ops : 1.060e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.46674905e+02 -1.07744354e+03 8.12e+02 1.04e-01 9.68e+00 0s 1 1.37374182e+02 -4.84872096e+02 4.80e+01 5.55e-16 1.16e+00 0s 2 5.81253728e+01 -7.61140883e+01 5.47e-02 3.61e-16 1.66e-01 0s 3 2.37257337e+01 2.86849944e+00 4.30e-03 1.11e-16 2.56e-02 0s 4 2.02782802e+01 1.88643279e+01 3.56e-06 1.63e-16 1.73e-03 0s 5 2.00025778e+01 1.99981190e+01 1.54e-10 1.80e-16 5.47e-06 0s 6 2.00000000e+01 2.00000000e+01 3.59e-13 3.33e-16 5.97e-12 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 2.00000000e+01 Root relaxation: objective 2.000000e+01, 266 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 20.0000000 20.00000 0.0% - 0s Explored 0 nodes (266 simplex iterations) in 0.01 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.000000000000e+01, best bound 2.000000000000e+01, gap 0.0% Preprocessing time: 0.07 seconds Gurobi run time: 0.01 seconds Total run time: 0.09 seconds Objective: 20 Solution: 1 x [17, 21, 32, 38, 42] 1 x [14, 16, 24, 35, 41] 2 x [3, 23, 29, 29, 40] 3 x [4, 26, 35, 36, 39] 2 x [2, 17, 22, 26, 37] 1 x [20, 20, 34, 36, 36] 1 x [1, 2, 3, 7, 34] 2 x [9, 10, 16, 25, 33] 2 x [10, 17, 19, 30, 31] 3 x [5, 6, 18, 27, 28] 1 x [6, 8, 11, 13, 15] 1 x [3, 3, 8, 10, 12]