Build (method = -2) #dp: 60 Step-3' Graph: 12 vertices and 34 arcs (0.00s) Step-4' Graph: 7 vertices and 24 arcs (0.00s) #V4/#V3 = 0.58 #A4/#A3 = 0.71 Ready! (0.00s) Optimize a model with 16 rows, 25 columns and 67 nonzeros Presolve removed 13 rows and 19 columns Presolve time: 0.00s Presolved: 3 rows, 6 columns, 11 nonzeros Variable types: 0 continuous, 6 integer (0 binary) Found heuristic solution: objective 60.0000000 Optimize a model with 3 rows, 6 columns and 11 nonzeros Presolved: 3 rows, 6 columns, 11 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.000e+00 Factor NZ : 6.000e+00 Factor Ops : 1.400e+01 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.54494791e+01 2.48928142e+01 0.00e+00 0.00e+00 3.77e+00 0s 1 5.83642526e+01 5.08506144e+01 0.00e+00 2.22e-16 5.16e-01 0s 2 5.60205308e+01 5.59162123e+01 0.00e+00 2.22e-16 6.95e-03 0s 3 5.60000205e+01 5.59999162e+01 0.00e+00 1.17e-17 6.95e-06 0s 4 5.60000000e+01 5.59999999e+01 0.00e+00 1.11e-16 6.95e-09 0s 5 5.60000000e+01 5.60000000e+01 0.00e+00 1.11e-16 7.27e-15 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 5.60000000e+01 Root relaxation: objective 5.600000e+01, 5 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 56.0000000 56.00000 0.0% - 0s Explored 0 nodes (5 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 5.600000000000e+01, best bound 5.600000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 56 Solution: 11 x [9] 1 x [3] 16 x [3, 5] 8 x [6, 8] 6 x [4, 8] 8 x [1, 7] 3 x [1, 2] 3 x [2, 2]