Build (method = -2) #dp: 108 Step-3' Graph: 20 vertices and 53 arcs (0.00s) Step-4' Graph: 18 vertices and 49 arcs (0.00s) #V4/#V3 = 0.90 #A4/#A3 = 0.92 Ready! (0.00s) Optimize a model with 28 rows, 50 columns and 118 nonzeros Presolve removed 12 rows and 19 columns Presolve time: 0.00s Presolved: 16 rows, 31 columns, 98 nonzeros Variable types: 0 continuous, 31 integer (0 binary) Optimize a model with 16 rows, 31 columns and 98 nonzeros Presolved: 16 rows, 31 columns, 98 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 7.200e+01 Factor NZ : 1.360e+02 Factor Ops : 1.496e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.42180133e+01 -2.85922722e+01 3.78e+01 5.55e-17 3.85e+00 0s 1 1.78434607e+01 -3.91312407e+00 4.87e+00 2.78e-16 6.35e-01 0s 2 1.54973863e+01 1.25671753e+01 1.04e+00 1.11e-16 8.06e-02 0s 3 1.60476772e+01 1.57073336e+01 6.22e-15 1.68e-16 6.42e-03 0s 4 1.60001998e+01 1.59997107e+01 7.46e-14 2.22e-16 9.23e-06 0s 5 1.60000000e+01 1.60000000e+01 2.79e-13 2.22e-16 9.24e-12 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 1.60000000e+01 Root relaxation: objective 1.600000e+01, 19 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 16.0000000 16.00000 0.0% - 0s Explored 0 nodes (19 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.600000000000e+01, best bound 1.600000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 16 Solution: 1 x [1, 4, 5, 6, 7, 8] 2 x [1, 5, 6, 7, 8] 1 x [1, 6, 7] 1 x [1, 6, 7, 8] 1 x [1, 6, 9] 6 x [2, 3, 4, 5, 6, 7, 8, 9, 10] 3 x [2, 5, 6, 7, 8, 9] 1 x [6, 9]