Build (method = -2) #dp: 95 Step-3' Graph: 16 vertices and 52 arcs (0.00s) Step-4' Graph: 13 vertices and 46 arcs (0.00s) #V4/#V3 = 0.81 #A4/#A3 = 0.88 Ready! (0.00s) Optimize a model with 23 rows, 47 columns and 122 nonzeros Presolve removed 7 rows and 8 columns Presolve time: 0.00s Presolved: 16 rows, 39 columns, 102 nonzeros Variable types: 0 continuous, 39 integer (0 binary) Found heuristic solution: objective 99.0000000 Found heuristic solution: objective 90.0000000 Optimize a model with 16 rows, 39 columns and 102 nonzeros Presolved: 16 rows, 39 columns, 102 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.800e+01 Factor NZ : 1.360e+02 Factor Ops : 1.496e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.06183160e+02 -4.14688261e+02 4.55e+02 1.11e-16 2.45e+01 0s 1 1.11990085e+02 -1.04666229e+02 3.58e+01 3.89e-16 3.38e+00 0s 2 7.05326653e+01 2.12197942e+01 8.63e-02 5.00e-15 5.88e-01 0s 3 5.20424107e+01 4.35999628e+01 3.96e-03 2.22e-16 1.01e-01 0s 4 4.85430783e+01 4.71907597e+01 2.43e-04 2.22e-16 1.61e-02 0s 5 4.82167096e+01 4.79335887e+01 3.70e-05 1.39e-16 3.37e-03 0s 6 4.81745826e+01 4.81628964e+01 2.27e-07 2.22e-16 1.39e-04 0s 7 4.81666668e+01 4.81666650e+01 1.66e-11 3.33e-16 2.10e-08 0s 8 4.81666667e+01 4.81666667e+01 8.73e-14 1.84e-16 2.10e-11 0s Barrier solved model in 8 iterations and 0.00 seconds Optimal objective 4.81666667e+01 Root relaxation: objective 4.816667e+01, 10 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 48.16667 0 9 90.00000 48.16667 46.5% - 0s H 0 0 49.0000000 48.16667 1.70% - 0s Explored 0 nodes (10 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 4.900000000000e+01, best bound 4.900000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 49 Solution: 9 x [5, 7] 6 x [5, 6] 1 x [2, 4] 19 x [8, 10] 3 x [6, 10] 6 x [1, 3] 1 x [1] 2 x [1, 9, 9] 1 x [2, 6] 1 x [2, 6, 6]