Build (method = -2) #dp: 5276 Step-3' Graph: 123 vertices and 925 arcs (0.02s) Step-4' Graph: 72 vertices and 823 arcs (0.03s) #V4/#V3 = 0.59 #A4/#A3 = 0.89 Ready! (0.03s) Optimize a model with 136 rows, 824 columns and 2334 nonzeros Presolve removed 25 rows and 28 columns Presolve time: 0.02s Presolved: 111 rows, 796 columns, 2281 nonzeros Variable types: 0 continuous, 796 integer (484 binary) Found heuristic solution: objective 72.0000000 Found heuristic solution: objective 67.0000000 Optimize a model with 111 rows, 796 columns and 2281 nonzeros Presolved: 111 rows, 796 columns, 2281 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.580e+03 Factor NZ : 3.070e+03 Factor Ops : 1.298e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.61365152e+03 -5.17146267e+03 4.89e+03 2.47e-01 2.92e+01 0s 1 4.52684607e+02 -1.04926499e+03 7.89e+02 5.55e-16 4.68e+00 0s 2 1.08140329e+02 -3.37526330e+02 4.98e+01 8.88e-16 4.87e-01 0s 3 5.66318095e+01 -2.87434734e+01 2.32e+00 4.44e-16 5.93e-02 0s 4 4.05189505e+01 1.00456423e+01 4.77e-01 2.98e-16 1.96e-02 0s 5 3.62099618e+01 2.64278378e+01 1.29e-01 2.22e-16 6.14e-03 0s 6 3.48609028e+01 3.10521292e+01 5.09e-02 2.22e-16 2.38e-03 0s 7 3.42543326e+01 3.27059620e+01 2.25e-02 4.44e-16 9.66e-04 0s 8 3.38052564e+01 3.31783599e+01 9.98e-04 2.22e-16 3.89e-04 0s 9 3.37451447e+01 3.34985060e+01 3.74e-04 3.33e-16 1.53e-04 0s 10 3.37036730e+01 3.36880552e+01 5.75e-07 3.33e-16 9.68e-06 0s 11 3.37000097e+01 3.36999810e+01 1.14e-14 2.47e-16 1.78e-08 0s 12 3.37000000e+01 3.37000000e+01 5.33e-15 2.24e-16 1.78e-11 0s Barrier solved model in 12 iterations and 0.01 seconds Optimal objective 3.37000000e+01 Root relaxation: objective 3.370000e+01, 311 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 33.70000 0 22 67.00000 33.70000 49.7% - 0s H 0 0 37.0000000 33.70000 8.92% - 0s H 0 0 34.0000000 33.70000 0.88% - 0s Explored 0 nodes (643 simplex iterations) in 0.06 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 3.400000000000e+01, best bound 3.400000000000e+01, gap 0.0% Preprocessing time: 0.04 seconds Gurobi run time: 0.06 seconds Total run time: 0.10 seconds Objective: 34 Solution: 1 x [6, 64] 1 x [10, 18, 63] 1 x [12, 17, 63] 1 x [11, 18, 62] 1 x [14, 14, 62] 1 x [2, 26, 61] 1 x [16, 17, 60] 1 x [8, 23, 59] 1 x [8, 24, 58] 1 x [15, 20, 58] 1 x [18, 18, 57] 1 x [36, 56] 1 x [7, 26, 56] 1 x [1, 37, 55] 1 x [4, 31, 55] 1 x [6, 29, 55] 1 x [1, 36, 54] 1 x [13, 23, 54] 1 x [5, 32, 53] 1 x [6, 28, 53] 1 x [5, 33, 52] 1 x [19, 21, 51] 1 x [1, 41, 50] 1 x [2, 38, 49] 1 x [12, 30, 48] 1 x [2, 39, 47] 2 x [15, 27, 46] 1 x [10, 34, 45] 1 x [16, 29, 44] 1 x [3, 42, 43] 1 x [9, 37, 40] 1 x [22, 25, 40] 1 x [14, 35, 39]