Build (method = -2) #dp: 4063 Step-3' Graph: 102 vertices and 1781 arcs (0.02s) Step-4' Graph: 102 vertices and 1781 arcs (0.02s) #V4/#V3 = 1.00 #A4/#A3 = 1.00 Ready! (0.02s) Optimize a model with 169 rows, 1782 columns and 5147 nonzeros Presolve removed 34 rows and 34 columns Presolve time: 0.03s Presolved: 135 rows, 1748 columns, 5079 nonzeros Variable types: 0 continuous, 1748 integer (1074 binary) Found heuristic solution: objective 65.0000000 Found heuristic solution: objective 56.0000000 Optimize a model with 135 rows, 1748 columns and 5079 nonzeros Presolved: 135 rows, 1748 columns, 5079 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.842e+03 Factor NZ : 6.462e+03 Factor Ops : 4.171e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.38961019e+03 -6.39461426e+03 3.95e+03 1.74e-01 2.40e+01 0s 1 9.29536015e+02 -2.87730919e+03 8.11e+02 6.66e-16 5.23e+00 0s 2 2.19952414e+02 -1.21964597e+03 8.49e+01 4.44e-16 8.07e-01 0s 3 9.42897212e+01 -1.81552795e+02 6.51e+00 2.66e-15 1.00e-01 0s 4 6.39140295e+01 -5.74510203e+00 1.73e+00 3.33e-16 2.37e-02 0s 5 5.29765954e+01 1.95447695e+01 7.27e-01 4.44e-16 1.06e-02 0s 6 4.72489017e+01 2.77665506e+01 3.12e-01 2.27e-16 5.91e-03 0s 7 4.47514928e+01 3.31142572e+01 1.71e-01 2.35e-16 3.47e-03 0s 8 4.36233261e+01 3.81772655e+01 1.14e-01 3.15e-16 1.64e-03 0s 9 4.18041909e+01 4.06208565e+01 2.54e-02 2.18e-16 3.56e-04 0s 10 4.15054847e+01 4.14662629e+01 3.33e-04 2.22e-16 1.14e-05 0s 11 4.15000065e+01 4.14999663e+01 5.33e-14 3.33e-16 1.15e-08 0s 12 4.15000000e+01 4.15000000e+01 9.41e-14 2.57e-16 1.15e-11 0s Barrier solved model in 12 iterations and 0.02 seconds Optimal objective 4.15000000e+01 Root relaxation: objective 4.150000e+01, 917 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 41.50000 0 17 56.00000 41.50000 25.9% - 0s H 0 0 42.0000000 41.50000 1.19% - 0s Explored 0 nodes (1327 simplex iterations) in 0.10 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 4.200000000000e+01, best bound 4.200000000000e+01, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.10 seconds Total run time: 0.13 seconds Objective: 42 Solution: 1 x [1, 67] 3 x [13, 66] 1 x [3, 4, 4, 5, 65] 1 x [64] 1 x [11, 63] 1 x [19, 62] 1 x [17, 61] 1 x [22, 60] 1 x [20, 60] 1 x [21, 59] 1 x [23, 58] 1 x [19, 57] 1 x [3, 5, 6, 7, 56] 1 x [25, 55] 1 x [24, 55] 1 x [27, 54] 1 x [25, 54] 1 x [26, 53] 1 x [6, 22, 53] 1 x [14, 16, 53] 1 x [28, 52] 1 x [30, 51] 1 x [31, 50] 1 x [33, 49] 2 x [34, 48] 1 x [29, 48] 1 x [29, 47] 1 x [36, 46] 2 x [40, 45] 1 x [39, 44] 1 x [40, 43] 1 x [40, 42] 1 x [16, 28, 41] 1 x [10, 38, 39] 1 x [1, 2, 12, 35, 37] 1 x [5, 15, 29, 34] 1 x [8, 32, 33] 1 x [9, 18, 29]