Build (method = -2) #dp: 6661 Step-3' Graph: 106 vertices and 307 arcs (0.03s) Step-4' Graph: 16 vertices and 127 arcs (0.03s) #V4/#V3 = 0.15 #A4/#A3 = 0.41 Ready! (0.03s) Optimize a model with 35 rows, 128 columns and 360 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 33 rows, 126 columns, 356 nonzeros Variable types: 0 continuous, 126 integer (0 binary) Found heuristic solution: objective 199.0000000 Found heuristic solution: objective 186.0000000 Optimize a model with 33 rows, 126 columns and 356 nonzeros Presolved: 33 rows, 126 columns, 356 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.440e+02 Factor NZ : 3.850e+02 Factor Ops : 5.985e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.03272534e+02 -1.18094714e+03 2.72e+02 1.11e-16 2.11e+01 0s 1 1.36931114e+02 -5.16903144e+02 4.80e+00 6.66e-16 2.70e+00 0s 2 9.18699405e+01 -8.70319498e+01 5.25e-01 2.22e-16 6.79e-01 0s 3 4.56418173e+01 1.74387975e+01 6.51e-04 1.49e-16 1.04e-01 0s 4 4.04718017e+01 3.83752389e+01 6.32e-05 2.69e-16 7.74e-03 0s 5 4.00013938e+01 3.99948967e+01 3.83e-09 2.66e-16 2.40e-05 0s 6 4.00000000e+01 4.00000000e+01 1.82e-14 3.33e-16 2.57e-11 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 4.00000000e+01 Root relaxation: objective 4.000000e+01, 104 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 40.0000000 40.00000 0.0% - 0s Explored 0 nodes (104 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 4.000000000000e+01, best bound 4.000000000000e+01, gap 0.0% Preprocessing time: 0.04 seconds Gurobi run time: 0.00 seconds Total run time: 0.04 seconds Objective: 40 Solution: 12 x [2, 4, 7, 17, 19] 2 x [4, 9, 14, 17, 19] 2 x [6, 8, 10, 13, 16] 6 x [8, 10, 11, 15, 17] 1 x [1, 4, 12, 14, 15] 3 x [2, 3, 6, 14, 15] 3 x [3, 5, 12, 15, 15] 11 x [1, 5, 6, 12, 18]