Build (method = -2) #dp: 6726 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 4 rows and 6 columns Presolve time: 0.00s Presolved: 31 rows, 122 columns, 349 nonzeros Variable types: 0 continuous, 122 integer (5 binary) Found heuristic solution: objective 198.0000000 Found heuristic solution: objective 125.0000000 Optimize a model with 31 rows, 122 columns and 349 nonzeros Presolved: 31 rows, 122 columns, 349 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.360e+02 Factor NZ : 3.360e+02 Factor Ops : 4.784e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 9.57461306e+02 -1.21465960e+03 4.30e+02 6.65e-02 3.54e+01 0s 1 2.13148358e+02 -6.47670490e+02 3.13e+01 3.33e-16 4.97e+00 0s 2 9.13306709e+01 -5.93105860e+01 7.56e-04 5.55e-16 5.80e-01 0s 3 4.42796313e+01 2.21557477e+01 6.43e-05 3.33e-16 8.45e-02 0s 4 4.05283515e+01 3.89745217e+01 9.72e-06 8.33e-17 5.93e-03 0s 5 4.00039472e+01 3.99917052e+01 6.15e-08 3.33e-16 4.67e-05 0s 6 4.00000000e+01 4.00000000e+01 5.83e-14 1.62e-16 6.22e-11 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 4.00000000e+01 Root relaxation: objective 4.000000e+01, 103 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 (103 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: 3 x [1, 2, 3, 9, 15] 5 x [3, 9, 16, 17, 19] 1 x [1, 2, 5, 6, 17] 1 x [1, 6, 7, 16, 17] 9 x [10, 12, 13, 18, 19] 3 x [1, 4, 12, 13, 16] 2 x [1, 5, 7, 11, 17] 15 x [4, 5, 7, 14, 15] 1 x [1, 8, 13, 17, 19]