Build (method = -2) #dp: 126 Step-3' Graph: 24 vertices and 65 arcs (0.00s) Step-4' Graph: 22 vertices and 61 arcs (0.00s) #V4/#V3 = 0.92 #A4/#A3 = 0.94 Ready! (0.00s) Optimize a model with 32 rows, 62 columns and 146 nonzeros Presolve removed 7 rows and 11 columns Presolve time: 0.00s Presolved: 25 rows, 51 columns, 131 nonzeros Variable types: 0 continuous, 51 integer (0 binary) Found heuristic solution: objective 19.0000000 Optimize a model with 25 rows, 51 columns and 131 nonzeros Presolved: 25 rows, 51 columns, 131 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 9.400e+01 Factor NZ : 2.440e+02 Factor Ops : 2.852e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.60067946e+01 -4.84843055e+02 2.78e+02 0.00e+00 1.70e+01 0s 1 3.37213732e+01 -1.75426550e+02 4.89e+01 2.22e-16 3.31e+00 0s 2 2.19492716e+01 -2.27978964e+01 1.69e-14 2.78e-16 4.07e-01 0s 3 1.97237038e+01 1.67858326e+01 7.99e-15 1.87e-16 2.67e-02 0s 4 1.90014559e+01 1.89845642e+01 3.75e-14 2.38e-16 1.54e-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.900000000000e+01, best bound 1.900000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 19 Solution: 3 x [1, 2, 3, 4, 5, 6, 8, 10] 1 x [1, 2, 4, 5, 6, 8, 10] 1 x [1, 4, 5, 6] 3 x [1, 4, 5, 6, 8, 9] 1 x [1, 5, 6] 1 x [1, 5, 6, 7, 9, 10] 1 x [1, 5, 6, 9, 10] 1 x [1, 6, 7, 9, 10] 7 x [2, 3, 4, 6]