Build (method = -2) #dp: 1107 Step-3' Graph: 68 vertices and 197 arcs (0.00s) Step-4' Graph: 23 vertices and 107 arcs (0.00s) #V4/#V3 = 0.34 #A4/#A3 = 0.54 Ready! (0.00s) Optimize a model with 33 rows, 108 columns and 282 nonzeros Presolve removed 11 rows and 21 columns Presolve time: 0.00s Presolved: 22 rows, 87 columns, 240 nonzeros Variable types: 0 continuous, 87 integer (0 binary) Found heuristic solution: objective 94.0000000 Found heuristic solution: objective 55.0000000 Optimize a model with 22 rows, 87 columns and 240 nonzeros Presolved: 22 rows, 87 columns, 240 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.010e+02 Factor NZ : 2.140e+02 Factor Ops : 2.664e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.90483608e+02 -1.13495204e+03 3.70e+02 2.22e-16 3.08e+01 0s 1 1.26512442e+02 -4.19857656e+02 1.62e+01 4.44e-16 3.77e+00 0s 2 6.08383666e+01 -6.58322027e+01 1.40e-02 2.22e-16 6.98e-01 0s 3 2.16926722e+01 2.42008772e+00 8.25e-04 2.22e-16 1.05e-01 0s 4 1.72533073e+01 1.51638274e+01 1.32e-04 2.22e-16 1.14e-02 0s 5 1.67223249e+01 1.66166984e+01 1.37e-06 2.22e-16 5.77e-04 0s 6 1.66666842e+01 1.66665878e+01 2.28e-09 2.22e-16 5.26e-07 0s 7 1.66666667e+01 1.66666667e+01 2.31e-14 1.12e-16 8.20e-13 0s Barrier solved model in 7 iterations and 0.00 seconds Optimal objective 1.66666667e+01 Root relaxation: objective 1.666667e+01, 62 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 16.66667 0 9 55.00000 16.66667 69.7% - 0s H 0 0 17.0000000 16.66667 1.96% - 0s Explored 0 nodes (68 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.700000000000e+01, best bound 1.700000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 17 Solution: 8 x [1, 2, 3, 4, 6, 10] 4 x [1, 2, 3, 4, 6, 6] 1 x [3, 4, 7, 7, 7, 7] 2 x [2, 3, 4, 4, 5, 9] 1 x [1, 1, 2, 9] 1 x [1, 2, 2, 3, 5, 8]