Build (method = -2) #dp: 148 Step-3' Graph: 30 vertices and 94 arcs (0.00s) Step-4' Graph: 27 vertices and 88 arcs (0.00s) #V4/#V3 = 0.90 #A4/#A3 = 0.94 Ready! (0.00s) Optimize a model with 36 rows, 89 columns and 225 nonzeros Presolve removed 12 rows and 19 columns Presolve time: 0.00s Presolved: 24 rows, 70 columns, 186 nonzeros Variable types: 0 continuous, 70 integer (0 binary) Found heuristic solution: objective 82.0000000 Found heuristic solution: objective 73.0000000 Optimize a model with 24 rows, 70 columns and 186 nonzeros Presolved: 24 rows, 70 columns, 186 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 9.600e+01 Factor NZ : 2.440e+02 Factor Ops : 2.996e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.08003012e+02 -6.86362092e+02 4.07e+02 2.22e-16 1.78e+01 0s 1 1.04404015e+02 -2.21514063e+02 5.36e+01 2.78e-16 3.20e+00 0s 2 6.67147034e+01 -1.78877616e+01 1.64e-01 1.24e-14 5.89e-01 0s 3 5.41702472e+01 1.89428018e+01 3.12e-02 5.33e-15 2.45e-01 0s 4 4.89476917e+01 3.42811615e+01 5.99e-03 2.22e-15 1.02e-01 0s 5 4.62820414e+01 4.49010260e+01 6.61e-04 2.22e-16 9.59e-03 0s 6 4.60106439e+01 4.59871689e+01 2.83e-05 1.41e-16 1.63e-04 0s 7 4.60000003e+01 4.59999997e+01 9.83e-10 1.82e-16 4.15e-09 0s 8 4.60000000e+01 4.60000000e+01 1.35e-13 3.42e-16 4.15e-12 0s Barrier solved model in 8 iterations and 0.00 seconds Optimal objective 4.60000000e+01 Root relaxation: objective 4.600000e+01, 31 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 46.0000000 46.00000 0.0% - 0s Explored 0 nodes (43 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 4.600000000000e+01, best bound 4.600000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 46 Solution: 11 x [7, 9] 11 x [2, 8] 3 x [2, 3, 7] 3 x [2, 3] 8 x [5, 6] 1 x [4, 6] 5 x [3, 3, 4] 4 x [1, 1]