Build (method = -2) #dp: 69 Step-3' Graph: 20 vertices and 53 arcs (0.00s) Step-4' Graph: 12 vertices and 37 arcs (0.00s) #V4/#V3 = 0.60 #A4/#A3 = 0.70 Ready! (0.00s) Optimize a model with 22 rows, 38 columns and 94 nonzeros Presolve removed 9 rows and 10 columns Presolve time: 0.00s Presolved: 13 rows, 28 columns, 70 nonzeros Variable types: 0 continuous, 28 integer (5 binary) Found heuristic solution: objective 673.0000000 Optimize a model with 13 rows, 28 columns and 70 nonzeros Presolved: 13 rows, 28 columns, 70 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.200e+01 Factor NZ : 9.100e+01 Factor Ops : 8.190e+02 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.48572281e+03 -2.06640438e+03 1.05e+03 9.99e-02 1.61e+02 0s 1 7.57092579e+02 -2.67270105e+02 7.22e+01 2.22e-16 2.16e+01 0s 2 6.61681151e+02 3.89049125e+02 8.77e+00 3.33e-16 4.82e+00 0s 3 6.37908764e+02 6.22883370e+02 1.28e-13 4.58e-16 2.55e-01 0s 4 6.37003053e+02 6.36985705e+02 5.68e-14 4.44e-16 2.94e-04 0s 5 6.37000000e+02 6.37000000e+02 5.68e-14 2.79e-16 3.53e-10 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 6.37000000e+02 Root relaxation: objective 6.370000e+02, 18 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 637.0000000 637.00000 0.0% - 0s Explored 0 nodes (18 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 6.370000000000e+02, best bound 6.370000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 637 Solution: 84 x [1, 10] 150 x [2] 6 x [3] 117 x [3, 8] 47 x [3, 9, 10] 15 x [4] 31 x [4, 9] 36 x [5, 6] 150 x [6] 1 x [6, 7]