Build (method = -2) #dp: 3626 Step-3' Graph: 92 vertices and 1134 arcs (0.01s) Step-4' Graph: 67 vertices and 1084 arcs (0.01s) #V4/#V3 = 0.73 #A4/#A3 = 0.96 Ready! (0.01s) Optimize a model with 131 rows, 1085 columns and 3125 nonzeros Presolve removed 29 rows and 40 columns Presolve time: 0.03s Presolved: 102 rows, 1045 columns, 2990 nonzeros Variable types: 0 continuous, 1045 integer (509 binary) Found heuristic solution: objective 102.0000000 Found heuristic solution: objective 94.0000000 Optimize a model with 102 rows, 1045 columns and 2990 nonzeros Presolved: 102 rows, 1045 columns, 2990 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.668e+03 Factor NZ : 3.086e+03 Factor Ops : 1.193e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.07049328e+03 -6.39752172e+03 1.16e+04 2.55e-01 3.29e+01 0s 1 5.07094625e+02 -1.88320452e+03 2.06e+03 8.88e-16 6.04e+00 0s 2 1.45977386e+02 -7.04606980e+02 1.43e+02 1.33e-15 7.02e-01 0s 3 9.13495654e+01 -1.01096754e+02 1.38e+01 7.49e-16 1.09e-01 0s 4 6.55461808e+01 1.00993589e+01 2.69e+00 7.49e-16 2.82e-02 0s 5 5.75641178e+01 3.04727942e+01 1.05e+00 5.97e-16 1.33e-02 0s 6 5.37970405e+01 4.04624140e+01 3.04e-01 5.78e-16 6.41e-03 0s 7 5.25681494e+01 4.72904375e+01 7.07e-02 4.68e-16 2.51e-03 0s 8 5.18615488e+01 4.98607997e+01 1.50e-02 8.33e-16 9.49e-04 0s 9 5.16267254e+01 5.06493069e+01 7.03e-03 8.88e-16 4.63e-04 0s 10 5.14622100e+01 5.09974450e+01 1.93e-03 8.88e-16 2.20e-04 0s 11 5.13743121e+01 5.12484593e+01 3.03e-04 5.68e-16 5.96e-05 0s 12 5.13416002e+01 5.13093229e+01 4.78e-05 1.01e-15 1.53e-05 0s 13 5.13367237e+01 5.13263833e+01 1.90e-05 7.21e-16 4.89e-06 0s 14 5.13334891e+01 5.13328089e+01 2.46e-07 5.55e-16 3.22e-07 0s 15 5.13333334e+01 5.13333331e+01 2.33e-11 4.44e-16 1.04e-10 0s 16 5.13333333e+01 5.13333333e+01 3.42e-14 5.86e-16 1.12e-16 0s Barrier solved model in 16 iterations and 0.02 seconds Optimal objective 5.13333333e+01 Root relaxation: objective 5.133333e+01, 95 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 51.33333 0 18 94.00000 51.33333 45.4% - 0s H 0 0 53.0000000 51.33333 3.14% - 0s H 0 0 52.0000000 51.33333 1.28% - 0s Explored 0 nodes (158 simplex iterations) in 0.07 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 5.200000000000e+01, best bound 5.200000000000e+01, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.07 seconds Total run time: 0.09 seconds Objective: 52 Solution: 1 x [20, 64] 1 x [19, 64] 1 x [18, 64] 1 x [21, 63] 1 x [19, 63] 1 x [1, 7, 63] 1 x [3, 6, 63] 1 x [22, 62] 1 x [24, 61] 1 x [25, 60] 1 x [23, 60] 2 x [26, 59] 1 x [2, 10, 59] 1 x [3, 9, 59] 1 x [5, 7, 58] 3 x [27, 57] 1 x [28, 56] 1 x [29, 55] 2 x [28, 55] 1 x [30, 54] 1 x [31, 53] 1 x [32, 52] 1 x [31, 52] 1 x [34, 51] 2 x [35, 50] 1 x [8, 10, 50] 1 x [5, 50] 1 x [36, 49] 1 x [8, 11, 49] 1 x [37, 48] 1 x [38, 47] 1 x [40, 46] 1 x [15, 46] 2 x [41, 45] 1 x [42, 44] 2 x [5, 17, 44] 2 x [43, 43] 1 x [11, 16, 39] 1 x [12, 14, 39] 1 x [13, 13, 39] 1 x [4, 30, 33] 1 x [12, 18, 33] 1 x [15, 16, 30] 1 x [9, 12, 15]