Build (method = -2) #dp: 5183 Step-3' Graph: 964 vertices and 2885 arcs (0.04s) Step-4' Graph: 481 vertices and 1919 arcs (0.04s) #V4/#V3 = 0.50 #A4/#A3 = 0.67 Ready! (0.04s) Optimize a model with 520 rows, 1920 columns and 4802 nonzeros Presolve removed 116 rows and 180 columns Presolve time: 0.03s Presolved: 404 rows, 1740 columns, 4758 nonzeros Variable types: 0 continuous, 1740 integer (344 binary) Found heuristic solution: objective 261.0000000 Optimize a model with 404 rows, 1740 columns and 4758 nonzeros Presolve removed 2 rows and 2 columns Presolved: 402 rows, 1738 columns, 4768 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.136e+03 Factor NZ : 1.329e+04 Factor Ops : 6.295e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.07026299e+03 -2.59265301e+04 4.51e+04 1.14e-01 7.13e+01 0s 1 7.86391082e+02 -1.31683544e+04 8.68e+03 6.66e-16 1.51e+01 0s 2 4.15235567e+02 -4.39429138e+03 1.11e+03 1.22e-15 2.56e+00 0s 3 3.23081254e+02 -1.29806119e+03 2.11e+02 7.77e-16 6.43e-01 0s 4 2.90050273e+02 -4.84022663e+02 6.27e+01 6.66e-16 2.62e-01 0s 5 2.66444861e+02 -2.29562280e+02 3.55e+01 7.22e-16 1.61e-01 0s 6 2.41220152e+02 -7.44843585e+01 1.25e+01 5.00e-16 9.62e-02 0s 7 2.20143314e+02 7.33499496e+01 3.83e+00 3.33e-16 4.35e-02 0s 8 2.09979796e+02 1.28635786e+02 1.80e+00 3.88e-16 2.39e-02 0s 9 2.02517099e+02 1.70959291e+02 4.88e-01 3.42e-16 9.16e-03 0s 10 1.98461410e+02 1.93606907e+02 2.08e-02 5.55e-16 1.39e-03 0s 11 1.97693263e+02 1.97615311e+02 3.25e-04 3.33e-16 2.24e-05 0s 12 1.97666669e+02 1.97666664e+02 3.03e-08 4.38e-16 1.49e-09 0s 13 1.97666667e+02 1.97666667e+02 3.13e-13 5.55e-16 1.59e-15 0s Barrier solved model in 13 iterations and 0.03 seconds Optimal objective 1.97666667e+02 Root relaxation: objective 1.976667e+02, 543 iterations, 0.04 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 197.66667 0 11 261.00000 197.66667 24.3% - 0s H 0 0 198.0000000 197.66667 0.17% - 0s Explored 0 nodes (806 simplex iterations) in 0.11 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.980000000000e+02, best bound 1.980000000000e+02, gap 0.0% Preprocessing time: 0.06 seconds Gurobi run time: 0.11 seconds Total run time: 0.16 seconds Objective: 198 Solution: 13 x [1] 6 x [1, 28] 1 x [1, 33, 39] 2 x [2, 39] 1 x [3] 8 x [4, 28] 10 x [4, 34, 37] 1 x [4, 36, 39] 7 x [5] 4 x [5, 27] 1 x [6] 1 x [6, 26, 39] 1 x [6, 34, 35] 6 x [6, 37] 9 x [7] 1 x [7, 29] 6 x [7, 30] 6 x [7, 34] 9 x [8] 1 x [9, 25] 11 x [9, 30] 12 x [10, 31] 7 x [10, 32] 7 x [11, 22] 7 x [12, 19] 10 x [13, 21] 12 x [13, 23] 7 x [14, 19, 38] 4 x [14, 21] 1 x [15, 23] 6 x [15, 23, 35] 2 x [16, 18] 2 x [17, 18, 39] 1 x [18] 2 x [18, 20, 39] 9 x [18, 22, 29] 1 x [18, 23, 38] 1 x [18, 24] 2 x [22, 23, 24, 38]