Build (method = -2) #dp: 3343 Step-3' Graph: 96 vertices and 1538 arcs (0.01s) Step-4' Graph: 95 vertices and 1536 arcs (0.01s) #V4/#V3 = 0.99 #A4/#A3 = 1.00 Ready! (0.01s) Optimize a model with 159 rows, 1537 columns and 4425 nonzeros Presolve removed 38 rows and 40 columns Presolve time: 0.03s Presolved: 121 rows, 1497 columns, 4322 nonzeros Variable types: 0 continuous, 1497 integer (684 binary) Found heuristic solution: objective 71.0000000 Found heuristic solution: objective 70.0000000 Optimize a model with 121 rows, 1497 columns and 4322 nonzeros Presolved: 121 rows, 1497 columns, 4322 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.917e+03 Factor NZ : 5.274e+03 Factor Ops : 3.052e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.49886966e+03 -5.53121668e+03 3.65e+03 1.00e-01 2.32e+01 0s 1 7.12877615e+02 -2.52403223e+03 5.92e+02 6.66e-16 4.22e+00 0s 2 1.81987228e+02 -1.00223906e+03 5.87e+01 6.66e-16 6.68e-01 0s 3 9.10537322e+01 -1.54942795e+02 4.46e+00 4.44e-16 9.53e-02 0s 4 6.86493943e+01 -7.03175804e+00 1.39e+00 3.89e-16 2.76e-02 0s 5 5.71444992e+01 1.39921691e+01 6.14e-01 2.62e-16 1.52e-02 0s 6 5.23101166e+01 2.74582527e+01 3.55e-01 2.28e-16 8.62e-03 0s 7 4.91120221e+01 2.97764698e+01 1.70e-01 2.22e-16 6.59e-03 0s 8 4.59409476e+01 3.87916480e+01 6.85e-02 1.69e-16 2.43e-03 0s 9 4.46370000e+01 4.07576396e+01 3.58e-02 2.93e-16 1.31e-03 0s 10 4.35386067e+01 4.18002071e+01 8.97e-03 1.79e-16 5.84e-04 0s 11 4.32206978e+01 4.25673036e+01 2.89e-03 2.22e-16 2.19e-04 0s 12 4.30826515e+01 4.28622125e+01 9.08e-04 2.60e-16 7.38e-05 0s 13 4.30260742e+01 4.29323737e+01 2.46e-04 1.77e-16 3.13e-05 0s 14 4.30023726e+01 4.29939946e+01 1.28e-05 3.33e-16 2.79e-06 0s 15 4.30000101e+01 4.29999802e+01 5.27e-08 2.22e-16 9.95e-09 0s 16 4.30000000e+01 4.30000000e+01 6.57e-13 2.22e-16 1.02e-14 0s Barrier solved model in 16 iterations and 0.02 seconds Optimal objective 4.30000000e+01 Root relaxation: objective 4.300000e+01, 98 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 43.00000 0 4 70.00000 43.00000 38.6% - 0s H 0 0 44.0000000 43.00000 2.27% - 0s H 0 0 43.0000000 43.00000 0.0% - 0s Explored 0 nodes (345 simplex iterations) in 0.09 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 4.300000000000e+01, best bound 4.300000000000e+01, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.09 seconds Total run time: 0.11 seconds Objective: 43 Solution: 1 x [11, 64] 1 x [12, 63] 1 x [3, 6, 62] 1 x [13, 61] 1 x [14, 60] 1 x [14, 59] 1 x [15, 58] 1 x [13, 58] 1 x [16, 57] 1 x [16, 56] 1 x [17, 55] 1 x [18, 54] 2 x [19, 53] 2 x [4, 13, 52] 1 x [20, 51] 1 x [8, 9, 50] 1 x [8, 10, 49] 1 x [2, 17, 48] 2 x [21, 47] 1 x [21, 46] 2 x [23, 45] 2 x [22, 45] 2 x [27, 44] 1 x [27, 43] 1 x [29, 42] 1 x [28, 42] 1 x [1, 24, 41] 1 x [31, 40] 1 x [3, 24, 39] 1 x [33, 38] 1 x [32, 38] 1 x [2, 30, 37] 1 x [34, 36] 1 x [5, 26, 36] 1 x [6, 25, 36] 1 x [2, 2, 24, 36] 1 x [7, 24, 35]