Build (method = -2) #dp: 2870 Step-3' Graph: 81 vertices and 234 arcs (0.01s) Step-4' Graph: 10 vertices and 92 arcs (0.01s) #V4/#V3 = 0.12 #A4/#A3 = 0.39 Ready! (0.01s) Optimize a model with 29 rows, 93 columns and 265 nonzeros Presolve removed 3 rows and 4 columns Presolve time: 0.00s Presolved: 26 rows, 89 columns, 257 nonzeros Variable types: 0 continuous, 89 integer (4 binary) Found heuristic solution: objective 111.0000000 Optimize a model with 26 rows, 89 columns and 257 nonzeros Presolved: 26 rows, 89 columns, 257 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 9.500e+01 Factor NZ : 3.130e+02 Factor Ops : 4.985e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 9.06435611e+02 -1.01696628e+03 2.06e+02 4.10e-02 3.30e+01 0s 1 2.05279295e+02 -4.59829634e+02 8.54e+00 3.33e-16 4.22e+00 0s 2 9.74096876e+01 -1.23720948e+01 6.08e-03 6.66e-16 5.66e-01 0s 3 5.24493618e+01 2.86061628e+01 7.69e-05 2.22e-16 1.22e-01 0s 4 5.03916628e+01 4.88841749e+01 1.02e-05 3.33e-16 7.69e-03 0s 5 5.00017665e+01 4.99954117e+01 3.68e-08 2.22e-16 3.24e-05 0s 6 5.00000000e+01 5.00000000e+01 3.32e-14 2.77e-16 3.42e-11 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 5.00000000e+01 Root relaxation: objective 5.000000e+01, 74 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 50.0000000 50.00000 0.0% - 0s Explored 0 nodes (74 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 5.000000000000e+01, best bound 5.000000000000e+01, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.00 seconds Total run time: 0.02 seconds Objective: 50 Solution: 13 x [1, 12, 15, 16] 1 x [3, 9, 18, 19] 2 x [1, 4, 9, 14] 11 x [5, 7, 11, 14] 4 x [10, 12, 14, 17] 2 x [4, 6, 11, 17] 5 x [4, 11, 17, 17] 10 x [3, 8, 13, 18] 1 x [2, 2, 3, 18] 1 x [3, 6, 17, 17]