Build (method = -2) #dp: 70 Step-3' Graph: 18 vertices and 47 arcs (0.00s) Step-4' Graph: 10 vertices and 31 arcs (0.00s) #V4/#V3 = 0.56 #A4/#A3 = 0.66 Ready! (0.00s) Optimize a model with 20 rows, 32 columns and 80 nonzeros Presolve removed 8 rows and 10 columns Presolve time: 0.00s Presolved: 12 rows, 22 columns, 54 nonzeros Variable types: 0 continuous, 22 integer (0 binary) Found heuristic solution: objective 647.0000000 Found heuristic solution: objective 614.0000000 Optimize a model with 12 rows, 22 columns and 54 nonzeros Presolved: 12 rows, 22 columns, 54 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.600e+01 Factor NZ : 7.800e+01 Factor Ops : 6.500e+02 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.47598597e+03 -1.59972040e+03 9.66e+02 2.22e-16 1.39e+02 0s 1 7.00473921e+02 -8.46520636e+01 6.93e+00 5.55e-16 1.63e+01 0s 2 5.81321132e+02 2.51639074e+02 3.97e-01 4.44e-16 6.74e+00 0s 3 5.31500380e+02 4.92843885e+02 2.91e-03 2.22e-16 7.89e-01 0s 4 5.29007545e+02 5.28962477e+02 2.84e-14 1.21e-16 9.20e-04 0s 5 5.29000000e+02 5.29000000e+02 5.37e-14 3.33e-16 9.31e-10 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 5.29000000e+02 Root relaxation: objective 5.290000e+02, 8 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 529.0000000 529.00000 0.0% - 0s Explored 0 nodes (8 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 5.290000000000e+02, best bound 5.290000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 529 Solution: 27 x [1] 31 x [2] 149 x [2, 10] 72 x [3, 4] 86 x [3, 9] 4 x [4, 9] 47 x [5, 6] 22 x [5, 9] 58 x [7, 9] 33 x [8, 9]