Build (method = -2) #dp: 755 Step-3' Graph: 55 vertices and 155 arcs (0.00s) Step-4' Graph: 11 vertices and 67 arcs (0.00s) #V4/#V3 = 0.20 #A4/#A3 = 0.43 Ready! (0.00s) Optimize a model with 21 rows, 68 columns and 189 nonzeros Presolve removed 4 rows and 6 columns Presolve time: 0.00s Presolved: 17 rows, 62 columns, 177 nonzeros Variable types: 0 continuous, 62 integer (0 binary) Found heuristic solution: objective 55.0000000 Optimize a model with 17 rows, 62 columns and 177 nonzeros Presolved: 17 rows, 62 columns, 177 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 6.800e+01 Factor NZ : 1.530e+02 Factor Ops : 1.785e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.34493792e+02 -6.57979930e+02 1.21e+02 1.11e-16 2.17e+01 0s 1 8.23218246e+01 -2.35227059e+02 2.04e+00 5.55e-16 2.60e+00 0s 2 4.20577235e+01 -5.17580740e+01 1.66e-01 1.28e-15 7.15e-01 0s 3 2.21725377e+01 1.24118153e+01 6.31e-03 6.66e-16 7.29e-02 0s 4 2.00901436e+01 1.97048186e+01 1.80e-04 1.24e-15 2.87e-03 0s 5 2.00000465e+01 1.99998601e+01 6.90e-09 1.03e-15 1.39e-06 0s 6 2.00000000e+01 2.00000000e+01 9.95e-15 1.23e-15 1.40e-12 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 2.00000000e+01 Root relaxation: objective 2.000000e+01, 50 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 (50 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: 1 x [1, 3, 7, 8, 9] 6 x [1, 3, 8, 8, 10] 5 x [1, 3, 8, 8, 9] 2 x [1, 1, 2, 7, 9] 1 x [1, 1, 2, 3, 7] 5 x [1, 1, 4, 5, 6]