Build (method = -2) #dp: 6913 Step-3' Graph: 231 vertices and 4012 arcs (0.04s) Step-4' Graph: 186 vertices and 3922 arcs (0.04s) #V4/#V3 = 0.81 #A4/#A3 = 0.98 Ready! (0.04s) Optimize a model with 269 rows, 3923 columns and 11401 nonzeros Presolve removed 22 rows and 33 columns Presolve time: 0.06s Presolved: 247 rows, 3890 columns, 11242 nonzeros Variable types: 0 continuous, 3890 integer (3032 binary) Found heuristic solution: objective 75.0000000 Optimize a model with 247 rows, 3890 columns and 11242 nonzeros Presolved: 247 rows, 3890 columns, 11242 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.980e+03 Factor NZ : 1.188e+04 (roughly 2 MBytes of memory) Factor Ops : 7.575e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.32795980e+03 -2.23096206e+04 2.21e+04 1.50e-01 2.09e+01 0s 1 1.22009008e+03 -5.26023604e+03 3.57e+03 7.77e-16 3.57e+00 0s 2 2.71676117e+02 -1.22794268e+03 3.84e+02 6.66e-16 4.68e-01 0s 3 1.02446589e+02 -2.42903796e+02 4.19e+01 6.66e-16 7.03e-02 0s 4 5.70895140e+01 -3.99754786e+01 6.49e+00 4.02e-16 1.57e-02 0s 5 4.89554535e+01 3.96080184e+00 3.78e+00 3.33e-16 6.96e-03 0s 6 4.42113351e+01 1.57145625e+01 2.02e+00 4.72e-16 4.13e-03 0s 7 4.16121278e+01 2.02162208e+01 1.13e+00 4.44e-16 2.97e-03 0s 8 3.80461201e+01 2.88241986e+01 4.41e-01 5.27e-16 1.24e-03 0s 9 3.66237192e+01 3.26921004e+01 1.62e-01 4.44e-16 5.18e-04 0s 10 3.58620116e+01 3.40709905e+01 5.58e-02 4.44e-16 2.33e-04 0s 11 3.53089593e+01 3.47953655e+01 4.77e-03 4.44e-16 6.62e-05 0s 12 3.51641278e+01 3.50017985e+01 7.23e-04 4.44e-16 2.09e-05 0s 13 3.51353233e+01 3.50727820e+01 2.56e-04 3.09e-16 8.04e-06 0s 14 3.51227105e+01 3.50999105e+01 1.02e-04 4.44e-16 2.93e-06 0s 15 3.51143362e+01 3.51126106e+01 3.03e-06 3.33e-16 2.21e-07 0s 16 3.51138331e+01 3.51138325e+01 1.53e-14 3.33e-16 7.11e-11 0s 17 3.51138329e+01 3.51138329e+01 3.02e-14 3.89e-16 7.11e-14 0s Barrier solved model in 17 iterations and 0.06 seconds Optimal objective 3.51138329e+01 Root relaxation: objective 3.511383e+01, 278 iterations, 0.06 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 35.11383 0 62 75.00000 35.11383 53.2% - 0s H 0 0 37.0000000 35.11383 5.10% - 0s H 0 0 36.0000000 35.11383 2.46% - 0s Explored 0 nodes (611 simplex iterations) in 0.21 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 3.600000000000e+01, best bound 3.600000000000e+01, gap 0.0% Preprocessing time: 0.06 seconds Gurobi run time: 0.21 seconds Total run time: 0.28 seconds Objective: 36 Solution: 1 x [66, 73] 1 x [50, 57] 1 x [75, 82] 1 x [3, 78] 1 x [55, 58] 1 x [3, 40, 69] 1 x [45, 53] 1 x [53, 62, 80] 1 x [71, 80] 1 x [7, 22, 42] 1 x [33, 63, 83] 1 x [54, 60, 67] 1 x [10, 26, 60] 1 x [36, 39, 83] 1 x [14, 29, 31] 1 x [31, 52, 74] 1 x [15, 30, 34] 1 x [4, 27, 59] 1 x [8, 24, 38] 1 x [13, 23, 37] 1 x [20, 32, 46] 1 x [1, 21, 51] 1 x [6, 18, 48] 1 x [11, 17, 44] 1 x [1, 12, 56] 1 x [11, 28, 35] 1 x [61, 64, 76] 1 x [4, 9, 72] 1 x [6, 16, 49] 1 x [5, 22, 43] 1 x [2, 43, 70] 1 x [79, 81] 1 x [25, 47, 79] 1 x [7, 68, 77] 1 x [19, 61, 77] 1 x [41, 47, 65]