Build (method = -2) #dp: 584 Step-3' Graph: 59 vertices and 166 arcs (0.00s) Step-4' Graph: 14 vertices and 76 arcs (0.00s) #V4/#V3 = 0.24 #A4/#A3 = 0.46 Ready! (0.00s) Optimize a model with 24 rows, 77 columns and 211 nonzeros Presolve removed 4 rows and 6 columns Presolve time: 0.00s Presolved: 20 rows, 71 columns, 199 nonzeros Variable types: 0 continuous, 71 integer (10 binary) Found heuristic solution: objective 97.0000000 Found heuristic solution: objective 52.0000000 Optimize a model with 20 rows, 71 columns and 199 nonzeros Presolved: 20 rows, 71 columns, 199 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 8.200e+01 Factor NZ : 1.660e+02 Factor Ops : 1.726e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.06566217e+02 -5.79748734e+02 2.75e+02 8.48e-02 2.53e+01 0s 1 9.56980486e+01 -2.68309013e+02 2.25e+01 4.44e-16 3.64e+00 0s 2 3.92003171e+01 -1.77329320e+01 8.79e-14 2.22e-16 3.81e-01 0s 3 2.18139623e+01 1.51502766e+01 9.88e-15 2.79e-16 4.44e-02 0s 4 2.02116571e+01 1.96697633e+01 1.69e-14 2.22e-16 3.61e-03 0s 5 2.00010860e+01 1.99979488e+01 1.94e-14 1.59e-16 2.09e-05 0s 6 2.00000000e+01 2.00000000e+01 6.40e-15 2.22e-16 2.22e-11 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 2.00000000e+01 Root relaxation: objective 2.000000e+01, 56 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 (56 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: 11 x [1, 3, 7, 8, 9] 4 x [3, 4, 4, 4, 7] 1 x [1, 3, 3, 6, 7] 1 x [4, 5, 7, 8, 10] 1 x [2, 4, 7, 7, 10] 2 x [4, 4, 5, 7, 8]