Build (method = -2) #dp: 120 Step-3' Graph: 25 vertices and 68 arcs (0.00s) Step-4' Graph: 22 vertices and 62 arcs (0.00s) #V4/#V3 = 0.88 #A4/#A3 = 0.91 Ready! (0.00s) Optimize a model with 31 rows, 63 columns and 149 nonzeros Presolve removed 9 rows and 15 columns Presolve time: 0.00s Presolved: 22 rows, 48 columns, 123 nonzeros Variable types: 0 continuous, 48 integer (0 binary) Found heuristic solution: objective 111.0000000 Optimize a model with 22 rows, 48 columns and 123 nonzeros Presolve removed 1 rows and 1 columns Presolved: 21 rows, 47 columns, 122 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 8.000e+01 Factor NZ : 1.770e+02 Factor Ops : 1.799e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.95402954e+02 -9.34543782e+02 6.63e+02 8.94e-02 4.32e+01 0s 1 1.55718172e+02 -1.50487666e+02 1.16e+02 3.33e-16 7.08e+00 0s 2 1.11497116e+02 2.59272523e+01 1.05e+01 2.22e-16 1.10e+00 0s 3 1.11933479e+02 1.02867187e+02 3.20e-14 2.22e-16 8.98e-02 0s 4 1.11018394e+02 1.10925276e+02 4.44e-14 2.22e-16 9.22e-04 0s Barrier performed 4 iterations in 0.00 seconds Objective cutoff exceeded Root relaxation: cutoff, 0 iterations, 0.00 seconds Explored 0 nodes (0 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.110000000000e+02, best bound 1.110000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 111 Solution: 4 x [1, 3, 6, 7] 1 x [2, 3] 4 x [2, 3, 4] 89 x [3] 9 x [3, 4] 2 x [3, 5, 6, 8, 9] 2 x [3, 5, 8, 9]