Build (method = -2) #dp: 6152 Step-3' Graph: 97 vertices and 280 arcs (0.03s) Step-4' Graph: 7 vertices and 100 arcs (0.03s) #V4/#V3 = 0.07 #A4/#A3 = 0.36 Ready! (0.03s) Optimize a model with 26 rows, 101 columns and 297 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 24 rows, 99 columns, 293 nonzeros Variable types: 0 continuous, 99 integer (5 binary) Found heuristic solution: objective 198.0000000 Found heuristic solution: objective 182.0000000 Optimize a model with 24 rows, 99 columns and 293 nonzeros Presolved: 24 rows, 99 columns, 293 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.020e+02 Factor NZ : 3.000e+02 Factor Ops : 4.900e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.06559238e+03 -1.27741279e+03 2.19e+02 3.48e-02 4.35e+01 0s 1 2.15265401e+02 -6.99137085e+02 1.27e+01 3.33e-16 5.84e+00 0s 2 1.01768411e+02 -4.77442005e+01 1.39e-03 2.22e-16 7.01e-01 0s 3 4.23467039e+01 2.38951009e+01 1.09e-04 2.22e-16 8.54e-02 0s 4 4.02232785e+01 3.97990776e+01 1.95e-07 3.33e-16 1.96e-03 0s 5 4.00000119e+01 3.99999641e+01 3.51e-11 2.60e-16 2.21e-07 0s 6 4.00000000e+01 4.00000000e+01 3.56e-14 2.22e-16 2.23e-13 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 4.00000000e+01 Root relaxation: objective 4.000000e+01, 85 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 (85 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.03 seconds Gurobi run time: 0.00 seconds Total run time: 0.04 seconds Objective: 40 Solution: 10 x [1, 2, 17, 18, 19] 3 x [4, 4, 7, 11, 19] 2 x [1, 6, 16, 17, 19] 1 x [13, 16, 16, 19, 19] 7 x [2, 3, 8, 10, 13] 1 x [2, 12, 14, 15, 16] 5 x [4, 5, 7, 11, 12] 1 x [4, 12, 14, 16, 16] 10 x [5, 6, 9, 14, 16]