Build (method = -2) #dp: 632 Step-3' Graph: 55 vertices and 154 arcs (0.00s) Step-4' Graph: 10 vertices and 64 arcs (0.00s) #V4/#V3 = 0.18 #A4/#A3 = 0.42 Ready! (0.00s) Optimize a model with 20 rows, 65 columns and 183 nonzeros Presolve removed 4 rows and 6 columns Presolve time: 0.00s Presolved: 16 rows, 59 columns, 172 nonzeros Variable types: 0 continuous, 59 integer (0 binary) Found heuristic solution: objective 99.0000000 Found heuristic solution: objective 78.0000000 Optimize a model with 16 rows, 59 columns and 172 nonzeros Presolved: 16 rows, 59 columns, 172 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 6.300e+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.88360879e+02 -6.02568413e+02 9.03e+01 1.11e-16 1.99e+01 0s 1 6.79709391e+01 -2.63594708e+02 9.46e-01 3.33e-16 2.75e+00 0s 2 4.25972470e+01 -4.61738583e+01 1.30e-02 3.33e-16 7.04e-01 0s 3 2.27752308e+01 9.35892538e+00 1.33e-05 1.39e-16 1.05e-01 0s 4 2.02788379e+01 1.93197648e+01 6.79e-07 1.11e-16 7.49e-03 0s 5 2.00004580e+01 1.99990922e+01 1.03e-09 1.35e-16 1.07e-05 0s 6 2.00000000e+01 2.00000000e+01 1.73e-14 2.22e-16 1.07e-11 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 2.00000000e+01 Root relaxation: objective 2.000000e+01, 49 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 20.0000000 20.00000 0.0% - 0s Explored 0 nodes (49 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.000000000000e+01, best bound 2.000000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 20 Solution: 5 x [3, 5, 8, 9, 10] 1 x [2, 2, 5, 8, 9] 1 x [2, 2, 2, 5, 9] 8 x [1, 3, 4, 5, 10] 4 x [2, 2, 4, 6, 7] 1 x [1, 2, 2, 5, 7]