Build (method = -2) #dp: 5133 Step-3' Graph: 178 vertices and 526 arcs (0.04s) Step-4' Graph: 53 vertices and 276 arcs (0.04s) #V4/#V3 = 0.30 #A4/#A3 = 0.52 Ready! (0.04s) Optimize a model with 81 rows, 277 columns and 730 nonzeros Presolve removed 12 rows and 23 columns Presolve time: 0.00s Presolved: 69 rows, 254 columns, 685 nonzeros Variable types: 0 continuous, 254 integer (56 binary) Found heuristic solution: objective 35.0000000 Found heuristic solution: objective 27.0000000 Optimize a model with 69 rows, 254 columns and 685 nonzeros Presolved: 69 rows, 254 columns, 685 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.160e+02 Factor NZ : 6.330e+02 Factor Ops : 7.417e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.37015663e+02 -5.49223722e+02 2.18e+02 1.01e-01 4.66e+00 0s 1 6.35709219e+01 -2.15672200e+02 1.42e+01 2.22e-16 7.01e-01 0s 2 2.83218619e+01 -3.96015076e+01 4.29e-01 2.78e-16 1.33e-01 0s 3 1.27419172e+01 -4.72857844e+00 1.88e-02 4.64e-04 3.35e-02 0s 4 1.02521031e+01 8.81490763e+00 5.12e-04 2.22e-16 2.74e-03 0s 5 1.00018414e+01 9.99676409e+00 5.49e-13 3.33e-16 9.69e-06 0s 6 1.00000000e+01 1.00000000e+01 1.37e-13 3.33e-16 1.03e-11 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 1.00000000e+01 Root relaxation: objective 1.000000e+01, 157 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 10.0000000 10.00000 0.0% - 0s Explored 0 nodes (157 simplex iterations) in 0.01 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.000000000000e+01, best bound 1.000000000000e+01, gap 0.0% Preprocessing time: 0.05 seconds Gurobi run time: 0.01 seconds Total run time: 0.06 seconds Objective: 10 Solution: 2 x [3, 6, 9, 11, 27] 1 x [2, 14, 15, 16, 17] 1 x [1, 7, 8, 22, 24] 1 x [1, 5, 9, 12, 21] 1 x [15, 21, 24, 26, 28] 1 x [18, 19, 22, 23, 25] 1 x [9, 10, 13, 15, 25] 2 x [4, 10, 12, 16, 20]