Build (method = -2) #dp: 6204 Step-3' Graph: 137 vertices and 837 arcs (0.03s) Step-4' Graph: 74 vertices and 711 arcs (0.03s) #V4/#V3 = 0.54 #A4/#A3 = 0.85 Ready! (0.03s) Optimize a model with 138 rows, 712 columns and 1993 nonzeros Presolve removed 21 rows and 23 columns Presolve time: 0.02s Presolved: 117 rows, 689 columns, 1953 nonzeros Variable types: 0 continuous, 689 integer (397 binary) Found heuristic solution: objective 66.0000000 Optimize a model with 117 rows, 689 columns and 1953 nonzeros Presolved: 117 rows, 689 columns, 1953 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.459e+03 Factor NZ : 3.089e+03 Factor Ops : 1.160e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.21056233e+03 -8.02724195e+03 3.42e+03 2.15e-01 4.75e+01 0s 1 9.73485165e+02 -1.57993940e+03 5.55e+02 4.44e-16 7.57e+00 0s 2 1.58023365e+02 -4.34521183e+02 3.86e+01 5.55e-16 7.84e-01 0s 3 7.30284015e+01 -9.15683304e+01 2.85e+00 4.44e-16 1.36e-01 0s 4 4.59455233e+01 -2.09912417e+01 5.69e-01 3.05e-16 5.02e-02 0s 5 4.04765445e+01 6.94551705e-01 2.96e-01 2.22e-16 2.92e-02 0s 6 3.74190157e+01 2.38098934e+01 1.72e-01 2.64e-16 9.88e-03 0s 7 3.39675173e+01 3.12238365e+01 6.03e-02 3.47e-16 1.98e-03 0s 8 3.33368493e+01 3.33049658e+01 3.60e-05 4.44e-16 2.28e-05 0s 9 3.33333334e+01 3.33333332e+01 1.25e-11 4.44e-16 1.42e-10 0s 10 3.33333333e+01 3.33333333e+01 1.23e-13 3.33e-16 1.42e-13 0s Barrier solved model in 10 iterations and 0.01 seconds Optimal objective 3.33333333e+01 Root relaxation: objective 3.333333e+01, 515 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 33.33333 0 21 66.00000 33.33333 49.5% - 0s H 0 0 36.0000000 33.33333 7.41% - 0s H 0 0 34.0000000 33.33333 1.96% - 0s Explored 0 nodes (755 simplex iterations) in 0.05 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.03 seconds Gurobi run time: 0.05 seconds Total run time: 0.08 seconds Objective: 34 Solution: 2 x [14, 20, 64] 1 x [12, 25, 63] 1 x [16, 22, 62] 1 x [13, 27, 61] 1 x [12, 23, 60] 1 x [12, 59] 1 x [9, 21, 58] 1 x [1, 29, 57] 1 x [15, 19, 57] 1 x [4, 29, 56] 1 x [3, 45, 55] 2 x [18, 24, 55] 2 x [2, 43, 54] 1 x [26, 28, 53] 1 x [10, 40, 52] 1 x [5, 47, 51] 2 x [8, 43, 50] 1 x [7, 45, 49] 1 x [26, 30, 48] 1 x [11, 43, 46] 1 x [27, 35, 44] 1 x [9, 41, 43] 1 x [11, 38, 43] 1 x [27, 35, 42] 1 x [1, 39] 1 x [9, 36, 37] 1 x [24, 33, 34] 1 x [31, 32, 34] 2 x [6, 13, 17]