Build (method = -2) #dp: 64 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 9 rows and 12 columns Presolve time: 0.00s Presolved: 11 rows, 20 columns, 51 nonzeros Variable types: 0 continuous, 20 integer (0 binary) Found heuristic solution: objective 793.0000000 Found heuristic solution: objective 705.0000000 Optimize a model with 11 rows, 20 columns and 51 nonzeros Presolved: 11 rows, 20 columns, 51 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.500e+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.30687349e+03 -5.81278248e+02 3.46e+02 2.22e-16 8.63e+01 0s 1 7.89378211e+02 2.26938453e+02 1.35e+01 2.22e-16 1.34e+01 0s 2 6.68964954e+02 4.86976008e+02 1.21e+00 2.22e-16 4.08e+00 0s 3 6.33756000e+02 6.12225851e+02 3.41e-03 2.29e-16 4.78e-01 0s 4 6.26435105e+02 6.24474238e+02 4.70e-05 1.11e-16 4.36e-02 0s 5 6.26002011e+02 6.25997594e+02 1.55e-08 2.22e-16 9.81e-05 0s 6 6.26000000e+02 6.26000000e+02 1.27e-12 4.44e-16 1.06e-10 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 6.26000000e+02 Root relaxation: objective 6.260000e+02, 7 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 626.0000000 626.00000 0.0% - 0s Explored 0 nodes (7 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 6.260000000000e+02, best bound 6.260000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 626 Solution: 125 x [1] 152 x [2] 49 x [3] 104 x [3, 10] 11 x [4, 5] 17 x [4, 6] 53 x [5, 6] 14 x [6, 8] 74 x [7, 8, 9] 27 x [8, 9]