Build (method = -2) #dp: 8702 Step-3' Graph: 168 vertices and 1855 arcs (0.06s) Step-4' Graph: 142 vertices and 1803 arcs (0.06s) #V4/#V3 = 0.85 #A4/#A3 = 0.97 Ready! (0.06s) Optimize a model with 182 rows, 1804 columns and 5137 nonzeros Presolve removed 6 rows and 10 columns Presolve time: 0.03s Presolved: 176 rows, 1794 columns, 5122 nonzeros Variable types: 0 continuous, 1794 integer (137 binary) Found heuristic solution: objective 625.0000000 Found heuristic solution: objective 561.0000000 Optimize a model with 176 rows, 1794 columns and 5122 nonzeros Presolved: 176 rows, 1794 columns, 5122 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.241e+03 Factor NZ : 7.318e+03 Factor Ops : 3.744e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.56740751e+04 -6.80714417e+04 9.29e+04 1.45e-01 3.62e+02 0s 1 7.39556861e+03 -3.61378900e+04 1.79e+04 5.55e-16 7.34e+01 0s 2 1.70136504e+03 -1.46758815e+04 2.24e+03 7.77e-16 1.15e+01 0s 3 7.97534326e+02 -3.09644034e+03 2.68e+02 3.55e-15 1.64e+00 0s 4 5.78500989e+02 -1.25072563e+03 6.83e+01 2.33e-15 6.03e-01 0s 5 3.81306737e+02 -6.91361888e+02 3.60e+01 8.88e-16 3.39e-01 0s 6 2.55052722e+02 -4.34752382e+02 1.72e+01 5.55e-16 2.08e-01 0s 7 1.91210781e+02 -2.07490316e+02 1.11e+01 4.44e-16 1.20e-01 0s 8 1.48214810e+02 -8.66058775e+01 5.47e+00 3.05e-16 6.84e-02 0s 9 1.32463366e+02 3.88497413e+01 3.19e+00 2.71e-16 2.70e-02 0s 10 1.20139908e+02 8.80547276e+01 1.27e+00 2.22e-16 9.09e-03 0s 11 1.12915695e+02 1.04288062e+02 1.35e-01 3.33e-16 2.39e-03 0s 12 1.11950975e+02 1.09211737e+02 3.04e-02 2.33e-16 7.58e-04 0s 13 1.11754477e+02 1.10429858e+02 1.53e-02 2.22e-16 3.66e-04 0s 14 1.11580989e+02 1.11370737e+02 6.63e-04 3.33e-16 5.80e-05 0s 15 1.11560824e+02 1.11549018e+02 2.20e-05 2.61e-16 3.26e-06 0s 16 1.11560001e+02 1.11559989e+02 9.89e-13 3.33e-16 3.26e-09 0s 17 1.11560000e+02 1.11560000e+02 2.28e-13 2.22e-16 3.36e-15 0s Barrier solved model in 17 iterations and 0.04 seconds Optimal objective 1.11560000e+02 Root relaxation: objective 1.115600e+02, 1342 iterations, 0.05 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 111.56000 0 59 561.00000 111.56000 80.1% - 0s H 0 0 116.0000000 111.56000 3.83% - 0s H 0 0 114.0000000 111.56000 2.14% - 0s H 0 0 113.0000000 111.56000 1.27% - 0s 0 0 111.56000 0 78 113.00000 111.56000 1.27% - 0s 0 0 111.56000 0 76 113.00000 111.56000 1.27% - 0s H 0 0 112.0000000 111.56000 0.39% - 0s Cutting planes: Zero half: 1 Explored 0 nodes (2747 simplex iterations) in 0.58 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.120000000000e+02, best bound 1.120000000000e+02, gap 0.0% Preprocessing time: 0.07 seconds Gurobi run time: 0.58 seconds Total run time: 0.65 seconds Objective: 112 Solution: 1 x [6, 12, 13] 11 x [12, 21, 22, 23, 24, 37] 3 x [3, 12, 21, 28, 29, 31] 5 x [7, 10, 11, 12, 19, 22] 3 x [12, 15, 22, 32, 36] 1 x [12, 15, 21, 25, 33] 3 x [1, 4, 12, 28, 29, 33] 2 x [6, 6, 20, 23] 2 x [1, 4, 14, 21, 23, 33] 13 x [10, 11, 19, 23, 35, 37] 1 x [7, 18, 20, 23, 25, 33] 4 x [1, 1, 14, 24, 27, 28] 1 x [21, 21, 24, 27, 29, 35] 1 x [21, 21, 24, 26, 29, 35] 7 x [14, 21, 24, 28, 29, 35] 2 x [10, 11, 19, 22, 24, 33] 4 x [14, 15, 21, 28, 29, 40] 1 x [11, 14, 19, 22, 29, 40] 2 x [5, 14, 17, 18, 35, 40] 2 x [1, 15, 15, 22, 29, 39] 6 x [5, 8, 18, 29, 35, 39] 1 x [7, 16, 17, 25, 35, 39] 1 x [3, 7, 9, 9, 39] 1 x [31, 31, 32, 34, 38] 14 x [15, 18, 34, 34, 36, 38] 1 x [1, 2, 15, 15, 22, 31] 3 x [1, 5, 15, 31, 33, 36] 3 x [7, 9, 20, 30, 31, 33] 2 x [25, 25, 25, 28, 31, 33] 2 x [7, 25, 31, 33, 33, 37] 3 x [3, 3, 4, 7, 7, 36] 1 x [1, 7, 15, 15, 22] 4 x [3, 3, 4, 7, 25, 35] 1 x [3, 3, 3, 3, 3, 9]