Build (method = -2) #dp: 6822 Step-3' Graph: 112 vertices and 2532 arcs (0.03s) Step-4' Graph: 112 vertices and 2532 arcs (0.03s) #V4/#V3 = 1.00 #A4/#A3 = 1.00 Ready! (0.03s) Optimize a model with 196 rows, 2533 columns and 7380 nonzeros Presolve removed 40 rows and 41 columns Presolve time: 0.03s Presolved: 156 rows, 2492 columns, 7280 nonzeros Variable types: 0 continuous, 2492 integer (754 binary) Found heuristic solution: objective 159.0000000 Found heuristic solution: objective 107.0000000 Optimize a model with 156 rows, 2492 columns and 7280 nonzeros Presolved: 156 rows, 2492 columns, 7280 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.513e+03 Factor NZ : 8.061e+03 (roughly 1 MByte of memory) Factor Ops : 5.609e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.80664345e+03 -1.16336626e+04 7.35e+03 1.49e-01 4.50e+01 0s 1 1.59973015e+03 -6.06492104e+03 1.38e+03 5.55e-16 9.03e+00 0s 2 3.35426243e+02 -2.60937128e+03 8.85e+01 6.66e-16 1.02e+00 0s 3 1.97322300e+02 -5.31365151e+02 6.40e+00 5.55e-16 1.64e-01 0s 4 1.62993136e+02 -1.05602932e+02 2.44e+00 2.91e-16 5.78e-02 0s 5 1.43452125e+02 4.04346041e-01 1.46e+00 3.33e-16 3.04e-02 0s 6 1.17280848e+02 4.27664465e+01 5.22e-01 2.60e-16 1.55e-02 0s 7 1.03660135e+02 6.50419001e+01 2.37e-01 2.22e-16 7.92e-03 0s 8 9.69061636e+01 7.74326498e+01 1.08e-01 2.22e-16 3.97e-03 0s 9 9.31653842e+01 8.30424988e+01 4.79e-02 2.22e-16 2.05e-03 0s 10 9.11926175e+01 8.81101107e+01 1.30e-02 2.13e-16 6.24e-04 0s 11 9.04468434e+01 8.95406399e+01 2.26e-03 2.26e-16 1.83e-04 0s 12 9.02223392e+01 9.01246147e+01 2.41e-04 3.15e-16 1.97e-05 0s 13 9.01667038e+01 9.01665962e+01 1.83e-07 3.33e-16 2.16e-08 0s 14 9.01666667e+01 9.01666667e+01 7.99e-13 3.21e-16 2.17e-14 0s Barrier solved model in 14 iterations and 0.03 seconds Optimal objective 9.01666667e+01 Root relaxation: objective 9.016667e+01, 877 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 90.16667 0 5 107.00000 90.16667 15.7% - 0s H 0 0 91.0000000 90.16667 0.92% - 0s Explored 0 nodes (1349 simplex iterations) in 0.12 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 9.100000000000e+01, best bound 9.100000000000e+01, gap 0.0% Preprocessing time: 0.05 seconds Gurobi run time: 0.12 seconds Total run time: 0.17 seconds Objective: 91 Solution: 2 x [8, 84] 2 x [18, 83] 1 x [17, 83] 1 x [14, 83] 1 x [1, 1, 5, 83] 1 x [17, 82] 3 x [21, 81] 1 x [80] 1 x [19, 80] 1 x [15, 80] 3 x [22, 79] 1 x [9, 13, 79] 1 x [23, 78] 1 x [4, 16, 78] 3 x [2, 4, 16, 78] 1 x [4, 17, 77] 2 x [11, 12, 77] 1 x [9, 77] 1 x [20, 76] 1 x [6, 76] 2 x [26, 75] 1 x [25, 75] 2 x [27, 74] 1 x [9, 19, 73] 1 x [27, 72] 1 x [3, 25, 72] 1 x [24, 72] 2 x [28, 71] 3 x [29, 70] 1 x [69] 1 x [30, 69] 2 x [31, 68] 2 x [32, 67] 2 x [31, 66] 4 x [34, 65] 1 x [35, 64] 2 x [36, 63] 1 x [35, 63] 1 x [37, 62] 1 x [38, 61] 1 x [6, 60] 1 x [39, 59] 1 x [7, 35, 58] 2 x [43, 57] 1 x [42, 57] 1 x [40, 57] 1 x [44, 56] 2 x [42, 56] 1 x [41, 56] 1 x [10, 33, 56] 3 x [45, 55] 1 x [44, 55] 4 x [46, 54] 1 x [44, 54] 1 x [38, 54] 1 x [47, 53] 1 x [8, 37, 53] 1 x [48, 52] 1 x [49, 51] 1 x [6, 7, 35, 51] 1 x [50] 1 x [50, 50] 1 x [31, 31, 31]