Build (method = -2) #dp: 134 Step-3' Graph: 27 vertices and 89 arcs (0.00s) Step-4' Graph: 15 vertices and 65 arcs (0.00s) #V4/#V3 = 0.56 #A4/#A3 = 0.73 Ready! (0.00s) Optimize a model with 25 rows, 66 columns and 175 nonzeros Presolve removed 5 rows and 5 columns Presolve time: 0.00s Presolved: 20 rows, 61 columns, 162 nonzeros Variable types: 0 continuous, 61 integer (0 binary) Found heuristic solution: objective 98.0000000 Found heuristic solution: objective 93.0000000 Optimize a model with 20 rows, 61 columns and 162 nonzeros Presolved: 20 rows, 61 columns, 162 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 7.900e+01 Factor NZ : 2.100e+02 Factor Ops : 2.870e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.71672038e+02 -7.37293924e+02 7.73e+02 2.22e-16 2.71e+01 0s 1 1.12062660e+02 -2.64507761e+02 5.56e+01 4.44e-16 3.81e+00 0s 2 6.56280935e+01 -9.73077384e+01 4.98e+00 2.78e-16 1.31e+00 0s 3 4.54650839e+01 1.09953909e+01 4.99e-03 2.91e-16 2.67e-01 0s 4 3.79239160e+01 2.78993933e+01 5.53e-04 1.27e-16 7.77e-02 0s 5 3.69979358e+01 3.52501190e+01 2.71e-04 3.33e-16 1.35e-02 0s 6 3.65019220e+01 3.64944140e+01 8.05e-07 1.66e-16 5.82e-05 0s 7 3.65000000e+01 3.65000000e+01 8.33e-13 2.22e-16 7.27e-11 0s Barrier solved model in 7 iterations and 0.00 seconds Optimal objective 3.65000000e+01 Root relaxation: objective 3.650000e+01, 23 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 36.50000 0 6 93.00000 36.50000 60.8% - 0s H 0 0 37.0000000 36.50000 1.35% - 0s Explored 0 nodes (23 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 3.700000000000e+01, best bound 3.700000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 37 Solution: 4 x [2, 4] 5 x [3, 4] 2 x [1, 1, 7] 4 x [5, 8] 4 x [6, 8, 9] 3 x [2, 2, 8] 11 x [3, 10, 10] 1 x [1, 3, 9] 1 x [1, 1, 3, 9] 1 x [2, 3, 6, 6] 1 x [3, 6, 6]