Build (method = -2) #dp: 136 Step-3' Graph: 26 vertices and 72 arcs (0.00s) Step-4' Graph: 20 vertices and 60 arcs (0.00s) #V4/#V3 = 0.77 #A4/#A3 = 0.83 Ready! (0.00s) Optimize a model with 30 rows, 61 columns and 155 nonzeros Presolve removed 7 rows and 8 columns Presolve time: 0.00s Presolved: 23 rows, 53 columns, 135 nonzeros Variable types: 0 continuous, 53 integer (5 binary) Found heuristic solution: objective 90.0000000 Found heuristic solution: objective 73.0000000 Optimize a model with 23 rows, 53 columns and 135 nonzeros Presolved: 23 rows, 53 columns, 135 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 8.600e+01 Factor NZ : 2.760e+02 Factor Ops : 4.324e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.00996074e+02 -5.12706366e+02 2.57e+02 3.55e-02 1.81e+01 0s 1 9.94384233e+01 -1.47013709e+02 4.33e+00 3.33e-16 2.37e+00 0s 2 7.00439557e+01 2.10575702e+01 2.40e-01 2.36e-16 4.46e-01 0s 3 6.03673811e+01 5.66891696e+01 1.66e-02 1.94e-16 3.32e-02 0s 4 5.95026810e+01 5.94912499e+01 2.19e-06 3.33e-16 1.03e-04 0s 5 5.95000000e+01 5.95000000e+01 2.32e-12 1.65e-16 1.17e-10 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 5.95000000e+01 Root relaxation: objective 5.950000e+01, 29 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 59.50000 0 2 73.00000 59.50000 18.5% - 0s H 0 0 60.0000000 59.50000 0.83% - 0s Explored 0 nodes (37 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 6.000000000000e+01, best bound 6.000000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 60 Solution: 3 x [5] 2 x [2] 1 x [2, 8] 14 x [9] 8 x [7] 6 x [7, 10] 7 x [6, 7] 1 x [1, 1, 1, 1, 1, 1, 1, 1, 1, 7] 1 x [4] 16 x [3, 4] 1 x [4, 4]