Build (method = -2) #dp: 191 Step-3' Graph: 23 vertices and 94 arcs (0.00s) Step-4' Graph: 16 vertices and 80 arcs (0.00s) #V4/#V3 = 0.70 #A4/#A3 = 0.85 Ready! (0.00s) Optimize a model with 36 rows, 81 columns and 218 nonzeros Presolve removed 22 rows and 42 columns Presolve time: 0.00s Presolved: 14 rows, 39 columns, 99 nonzeros Variable types: 0 continuous, 39 integer (0 binary) Found heuristic solution: objective 166.0000000 Optimize a model with 14 rows, 39 columns and 99 nonzeros Presolved: 14 rows, 39 columns, 99 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.000e+01 Factor NZ : 1.050e+02 Factor Ops : 1.015e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.75925457e+02 -2.42041082e+02 2.30e+02 2.22e-16 1.41e+01 0s 1 1.69121869e+02 9.72436159e+00 2.25e+00 2.22e-16 2.00e+00 0s 2 1.34324987e+02 1.04290601e+02 5.52e-03 1.67e-16 3.67e-01 0s 3 1.24889230e+02 1.23048142e+02 1.21e-04 3.02e-16 2.25e-02 0s 4 1.24504292e+02 1.24498409e+02 5.33e-14 1.54e-16 7.17e-05 0s 5 1.24500000e+02 1.24500000e+02 7.11e-14 1.69e-16 7.92e-11 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 1.24500000e+02 Root relaxation: objective 1.245000e+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 124.50000 0 2 166.00000 124.50000 25.0% - 0s H 0 0 125.0000000 124.50000 0.40% - 0s Explored 0 nodes (20 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.250000000000e+02, best bound 1.250000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 125 Solution: 4 x [16] 10 x [15] 10 x [13] 9 x [2] 5 x [9] 4 x [9, 19] 18 x [6, 12] 1 x [3] 1 x [4] 11 x [4, 11] 6 x [14] 15 x [1, 8] 1 x [7, 8] 4 x [5, 18] 3 x [10] 10 x [7, 10] 7 x [17, 20] 1 x [20] 5 x [20, 20]