Build (method = -2) #dp: 84 Step-3' Graph: 15 vertices and 47 arcs (0.00s) Step-4' Graph: 10 vertices and 37 arcs (0.00s) #V4/#V3 = 0.67 #A4/#A3 = 0.79 Ready! (0.00s) Optimize a model with 20 rows, 38 columns and 101 nonzeros Presolve removed 8 rows and 13 columns Presolve time: 0.00s Presolved: 12 rows, 25 columns, 66 nonzeros Variable types: 0 continuous, 25 integer (0 binary) Found heuristic solution: objective 818.0000000 Optimize a model with 12 rows, 25 columns and 66 nonzeros Presolve removed 1 rows and 1 columns Presolved: 11 rows, 24 columns, 64 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.400e+01 Factor NZ : 6.600e+01 Factor Ops : 5.060e+02 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.52627154e+03 -1.82018025e+03 5.65e+02 0.00e+00 1.17e+02 0s 1 7.50564083e+02 -2.76010761e+02 8.85e+00 5.55e-16 1.97e+01 0s 2 5.76985546e+02 2.70594677e+02 8.13e-01 2.22e-16 5.70e+00 0s 3 5.30795655e+02 5.14593550e+02 5.33e-14 1.20e-16 3.00e-01 0s 4 5.29015709e+02 5.28985714e+02 2.66e-14 1.18e-16 5.55e-04 0s 5 5.29000000e+02 5.29000000e+02 3.47e-14 3.33e-16 5.67e-10 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 5.29000000e+02 Root relaxation: objective 5.290000e+02, 14 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 (14 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: 58 x [7] 50 x [7, 9] 131 x [1, 10] 12 x [8, 10] 9 x [4, 5] 19 x [2, 3] 138 x [3, 6] 5 x [3, 4] 80 x [4, 8] 27 x [4, 4]