Build (method = -2) #dp: 193 Step-3' Graph: 37 vertices and 104 arcs (0.00s) Step-4' Graph: 32 vertices and 94 arcs (0.00s) #V4/#V3 = 0.86 #A4/#A3 = 0.90 Ready! (0.00s) Optimize a model with 42 rows, 95 columns and 225 nonzeros Presolve removed 17 rows and 32 columns Presolve time: 0.00s Presolved: 25 rows, 63 columns, 196 nonzeros Variable types: 0 continuous, 63 integer (0 binary) Optimize a model with 25 rows, 63 columns and 196 nonzeros Presolved: 25 rows, 63 columns, 196 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.460e+02 Factor NZ : 2.770e+02 Factor Ops : 3.749e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.64869863e+02 -8.02234657e+02 9.17e+02 5.55e-17 3.42e+01 0s 1 2.45127417e+02 -2.44239331e+02 1.17e+02 2.22e-16 5.89e+00 0s 2 1.96545063e+02 1.20208556e+02 1.48e+01 2.22e-16 7.48e-01 0s 3 1.94623408e+02 1.86938150e+02 3.61e-03 1.14e-16 6.41e-02 0s 4 1.94006309e+02 1.93980631e+02 9.95e-12 8.30e-17 2.14e-04 0s 5 1.94000000e+02 1.94000000e+02 4.77e-12 2.09e-16 2.18e-10 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 1.94000000e+02 Root relaxation: objective 1.940000e+02, 45 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 194.0000000 194.00000 0.0% - 0s Explored 0 nodes (45 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.940000000000e+02, best bound 1.940000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 194 Solution: 28 x [1, 2, 3, 4, 6, 7, 8] 23 x [1, 3, 6, 8, 10] 2 x [1, 3, 6, 10] 22 x [3, 4, 5, 6, 7, 8, 9] 60 x [3, 4, 5, 6, 8] 5 x [3, 4, 5, 6, 8, 9] 7 x [3, 4, 5, 6, 8, 10] 18 x [3, 4, 6, 8, 10] 2 x [3, 6, 8, 10] 3 x [3, 6, 10] 24 x [3, 10]