Build (method = -2) #dp: 140 Step-3' Graph: 17 vertices and 68 arcs (0.00s) Step-4' Graph: 10 vertices and 54 arcs (0.00s) #V4/#V3 = 0.59 #A4/#A3 = 0.79 Ready! (0.00s) Optimize a model with 30 rows, 55 columns and 151 nonzeros Presolve removed 19 rows and 26 columns Presolve time: 0.00s Presolved: 11 rows, 29 columns, 78 nonzeros Variable types: 0 continuous, 29 integer (0 binary) Found heuristic solution: objective 185.0000000 Optimize a model with 11 rows, 29 columns and 78 nonzeros Presolved: 11 rows, 29 columns, 78 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.800e+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 2.26221508e+02 -9.89996071e+01 6.30e+01 1.11e-16 8.34e+00 0s 1 1.71601126e+02 9.83208362e+01 1.78e-15 2.78e-16 1.18e+00 0s 2 1.49864343e+02 1.42395267e+02 1.60e-14 2.22e-16 1.19e-01 0s 3 1.48029135e+02 1.47831976e+02 1.42e-14 1.75e-16 3.13e-03 0s 4 1.48000037e+02 1.47999832e+02 2.82e-15 1.11e-16 3.25e-06 0s 5 1.48000000e+02 1.48000000e+02 3.55e-15 3.33e-16 3.25e-12 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 1.48000000e+02 Root relaxation: objective 1.480000e+02, 17 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 148.0000000 148.00000 0.0% - 0s Explored 0 nodes (17 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.480000000000e+02, best bound 1.480000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 148 Solution: 11 x [9] 15 x [12] 13 x [7] 6 x [17] 7 x [11, 17] 14 x [5] 5 x [1, 4] 6 x [15] 9 x [18] 8 x [3] 13 x [19] 1 x [16] 2 x [1, 16] 3 x [6, 13] 15 x [13, 14] 4 x [10, 20] 2 x [2, 8] 6 x [6, 8] 7 x [2, 20] 1 x [2, 2]