Build (method = -2) #dp: 4422 Step-3' Graph: 371 vertices and 2151 arcs (0.03s) Step-4' Graph: 344 vertices and 2097 arcs (0.03s) #V4/#V3 = 0.93 #A4/#A3 = 0.97 Ready! (0.03s) Optimize a model with 381 rows, 2098 columns and 5614 nonzeros Presolve removed 70 rows and 118 columns Presolve time: 0.04s Presolved: 311 rows, 1980 columns, 5461 nonzeros Variable types: 0 continuous, 1980 integer (140 binary) Found heuristic solution: objective 339.0000000 Found heuristic solution: objective 295.0000000 Optimize a model with 311 rows, 1980 columns and 5461 nonzeros Presolved: 311 rows, 1980 columns, 5461 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.350e+03 Factor NZ : 1.388e+04 (roughly 1 MByte of memory) Factor Ops : 1.020e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.97251641e+03 -5.67011149e+04 5.46e+04 7.22e-02 1.46e+02 0s 1 9.72399557e+02 -3.00986759e+04 1.04e+04 9.99e-16 3.08e+01 0s 2 5.04383838e+02 -1.28139831e+04 1.25e+03 4.31e-14 5.60e+00 0s 3 4.04993436e+02 -2.27666833e+03 1.14e+02 1.78e-15 8.15e-01 0s 4 3.87837180e+02 -5.32337436e+02 3.13e+01 8.88e-16 2.53e-01 0s 5 3.69912654e+02 -2.83746204e+02 1.86e+01 6.66e-16 1.74e-01 0s 6 3.39349865e+02 -2.69190242e+02 1.20e+01 5.55e-16 1.60e-01 0s 7 2.96072401e+02 -1.75545707e+01 7.25e+00 4.44e-16 8.20e-02 0s 8 2.64209403e+02 9.45310738e+01 4.25e+00 3.68e-16 4.41e-02 0s 9 2.14525749e+02 1.39927924e+02 1.03e+00 2.77e-16 1.91e-02 0s 10 1.97822614e+02 1.79582722e+02 1.18e-01 2.52e-16 4.61e-03 0s 11 1.94529321e+02 1.92218338e+02 1.14e-02 2.96e-16 5.84e-04 0s 12 1.94006019e+02 1.93957881e+02 6.81e-06 2.22e-16 1.21e-05 0s 13 1.94000000e+02 1.94000000e+02 1.84e-11 3.33e-16 2.43e-11 0s 14 1.94000000e+02 1.94000000e+02 1.14e-13 2.30e-16 5.00e-17 0s Barrier solved model in 14 iterations and 0.04 seconds Optimal objective 1.94000000e+02 Root relaxation: objective 1.940000e+02, 674 iterations, 0.05 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 194.0000000 194.00000 0.0% - 0s Explored 0 nodes (880 simplex iterations) in 0.15 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.940000000000e+02, best bound 1.940000000000e+02, gap 0.0% Preprocessing time: 0.05 seconds Gurobi run time: 0.15 seconds Total run time: 0.19 seconds Objective: 194 Solution: 10 x [13] 1 x [13, 22] 4 x [13, 22, 22] 7 x [28] 13 x [17, 19, 28] 7 x [25] 10 x [25, 35] 1 x [10, 25] 2 x [10, 10, 25] 10 x [23] 1 x [6, 23] 10 x [4, 23, 37] 1 x [7, 21] 3 x [11, 14] 5 x [20, 24] 5 x [32, 36] 14 x [32, 33] 3 x [30, 33] 3 x [31, 32] 12 x [15, 30] 2 x [9, 12] 1 x [12, 27] 9 x [9, 34] 7 x [7, 34] 2 x [5, 9] 5 x [5, 20] 5 x [26, 27] 2 x [18, 26] 5 x [16, 26] 2 x [2, 7] 3 x [1, 29] 2 x [1, 9] 6 x [1, 9, 17] 5 x [1, 11] 5 x [1, 11, 37] 5 x [1, 7] 1 x [3, 30, 30] 2 x [16, 18, 30] 3 x [7, 8, 18]