Build (method = -2) #dp: 957 Step-3' Graph: 68 vertices and 200 arcs (0.00s) Step-4' Graph: 33 vertices and 130 arcs (0.00s) #V4/#V3 = 0.49 #A4/#A3 = 0.65 Ready! (0.00s) Optimize a model with 42 rows, 131 columns and 336 nonzeros Presolve removed 12 rows and 24 columns Presolve time: 0.00s Presolved: 30 rows, 107 columns, 290 nonzeros Variable types: 0 continuous, 107 integer (7 binary) Found heuristic solution: objective 98.0000000 Found heuristic solution: objective 60.0000000 Optimize a model with 30 rows, 107 columns and 290 nonzeros Presolved: 30 rows, 107 columns, 290 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.430e+02 Factor NZ : 3.550e+02 Factor Ops : 5.055e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 8.25346245e+02 -1.69284381e+03 1.46e+03 6.73e-02 5.90e+01 0s 1 2.42093230e+02 -7.96529449e+02 2.67e+02 4.44e-16 1.15e+01 0s 2 6.85205869e+01 -2.13140239e+02 4.79e+00 4.44e-16 1.35e+00 0s 3 3.40362677e+01 -7.74279470e+00 2.88e-01 2.78e-16 1.90e-01 0s 4 1.92864033e+01 9.30021402e+00 8.99e-02 2.22e-16 4.52e-02 0s 5 1.73333652e+01 1.56147210e+01 1.23e-02 1.54e-16 7.75e-03 0s 6 1.66682725e+01 1.66610686e+01 2.78e-05 3.64e-16 3.25e-05 0s 7 1.66666667e+01 1.66666667e+01 3.33e-11 2.22e-16 3.80e-11 0s Barrier solved model in 7 iterations and 0.00 seconds Optimal objective 1.66666667e+01 Root relaxation: objective 1.666667e+01, 68 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 15 60.00000 16.66667 72.2% - 0s H 0 0 17.0000000 16.66667 1.96% - 0s Explored 0 nodes (77 simplex iterations) in 0.01 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.01 seconds Total run time: 0.02 seconds Objective: 17 Solution: 8 x [1, 2, 2, 3, 4, 4] 1 x [3, 4, 4, 5, 6] 2 x [3, 4, 4, 5, 5, 6] 2 x [1, 3, 5, 6, 8, 9] 1 x [3, 3, 5, 7, 8] 3 x [2, 3, 3, 3, 5, 8]