Build (method = -2) #dp: 906 Step-3' Graph: 51 vertices and 142 arcs (0.00s) Step-4' Graph: 7 vertices and 54 arcs (0.00s) #V4/#V3 = 0.14 #A4/#A3 = 0.38 Ready! (0.00s) Optimize a model with 17 rows, 55 columns and 159 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 15 rows, 53 columns, 155 nonzeros Variable types: 0 continuous, 53 integer (0 binary) Found heuristic solution: objective 99.0000000 Found heuristic solution: objective 96.0000000 Optimize a model with 15 rows, 53 columns and 155 nonzeros Presolved: 15 rows, 53 columns, 155 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.700e+01 Factor NZ : 1.200e+02 Factor Ops : 1.240e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.97452093e+02 -6.01039563e+02 5.66e+01 1.11e-16 2.16e+01 0s 1 6.61154597e+01 -2.61594688e+02 1.39e-13 4.44e-16 2.92e+00 0s 2 4.33008600e+01 -1.64266284e+01 2.13e-14 2.32e-16 5.22e-01 0s 3 2.05297939e+01 1.09737507e+01 1.33e-14 2.43e-16 8.24e-02 0s 4 2.00229267e+01 1.99561935e+01 3.69e-14 2.22e-16 5.75e-04 0s 5 2.00000001e+01 1.99999995e+01 2.13e-14 1.86e-16 4.94e-09 0s 6 2.00000000e+01 2.00000000e+01 1.26e-14 1.21e-16 5.29e-15 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 2.00000000e+01 Root relaxation: objective 2.000000e+01, 44 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 (44 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: 2 x [2, 3, 5, 7, 10] 2 x [1, 1, 3, 4, 7] 8 x [2, 3, 5, 8, 10] 7 x [1, 4, 6, 9, 10] 1 x [1, 1, 1, 1, 4]