Build (method = -2) #dp: 3541 Step-3' Graph: 92 vertices and 1210 arcs (0.01s) Step-4' Graph: 72 vertices and 1170 arcs (0.01s) #V4/#V3 = 0.78 #A4/#A3 = 0.97 Ready! (0.01s) Optimize a model with 141 rows, 1171 columns and 3375 nonzeros Presolve removed 28 rows and 42 columns Presolve time: 0.03s Presolved: 113 rows, 1129 columns, 3193 nonzeros Variable types: 0 continuous, 1129 integer (249 binary) Found heuristic solution: objective 173.0000000 Optimize a model with 113 rows, 1129 columns and 3193 nonzeros Presolved: 113 rows, 1129 columns, 3193 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.743e+03 Factor NZ : 3.304e+03 Factor Ops : 1.303e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.92468255e+03 -7.46540947e+03 2.07e+04 2.22e-01 4.08e+01 0s 1 1.14054068e+03 -2.72392662e+03 3.81e+03 6.11e-16 7.88e+00 0s 2 2.36602429e+02 -1.01367615e+03 2.29e+02 3.33e-15 8.60e-01 0s 3 1.45123331e+02 -2.57854286e+02 2.42e+01 6.66e-16 1.98e-01 0s 4 1.06399451e+02 -3.35738091e+01 1.91e+00 3.26e-16 6.21e-02 0s 5 9.61818533e+01 2.79792335e+01 7.11e-01 3.33e-16 3.00e-02 0s 6 9.08405046e+01 6.39218346e+01 1.14e-01 3.40e-16 1.18e-02 0s 7 8.83691474e+01 7.92654059e+01 3.25e-02 2.22e-16 3.97e-03 0s 8 8.73740970e+01 8.40841020e+01 1.05e-02 2.22e-16 1.44e-03 0s 9 8.69856961e+01 8.54685031e+01 4.05e-03 2.44e-16 6.62e-04 0s 10 8.67909775e+01 8.63051640e+01 1.41e-03 2.22e-16 2.12e-04 0s 11 8.67166386e+01 8.65544604e+01 7.20e-04 3.33e-16 7.08e-05 0s 12 8.66550013e+01 8.66172684e+01 1.51e-04 3.33e-16 1.65e-05 0s 13 8.66364947e+01 8.66354489e+01 5.24e-07 3.33e-16 4.56e-07 0s 14 8.66360564e+01 8.66360529e+01 3.04e-10 3.33e-16 1.52e-09 0s 15 8.66360544e+01 8.66360544e+01 8.14e-12 3.33e-16 2.19e-15 0s Barrier solved model in 15 iterations and 0.01 seconds Optimal objective 8.66360544e+01 Root relaxation: objective 8.663605e+01, 75 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 86.63605 0 34 173.00000 86.63605 49.9% - 0s H 0 0 89.0000000 86.63605 2.66% - 0s H 0 0 88.0000000 86.63605 1.55% - 0s H 0 0 87.0000000 86.63605 0.42% - 0s Explored 0 nodes (195 simplex iterations) in 0.08 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 8.700000000000e+01, best bound 8.700000000000e+01, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.08 seconds Total run time: 0.10 seconds Objective: 87 Solution: 3 x [21, 69] 2 x [19, 69] 2 x [18, 68] 1 x [23, 67] 1 x [22, 67] 3 x [20, 67] 1 x [17, 67] 3 x [24, 66] 1 x [25, 65] 2 x [26, 64] 1 x [27, 63] 1 x [28, 62] 4 x [29, 61] 3 x [30, 60] 2 x [28, 60] 1 x [31, 59] 2 x [30, 59] 2 x [1, 1, 59] 2 x [32, 58] 2 x [33, 57] 1 x [2, 2, 57] 1 x [2, 3, 56] 1 x [34, 55] 3 x [35, 54] 1 x [3, 4, 54] 1 x [36, 53] 3 x [37, 52] 1 x [39, 51] 1 x [40, 50] 1 x [39, 50] 1 x [3, 9, 50] 2 x [41, 49] 1 x [4, 9, 49] 1 x [6, 7, 49] 2 x [42, 48] 3 x [4, 10, 48] 1 x [3, 48] 4 x [43, 47] 1 x [44, 46] 2 x [43, 46] 2 x [2, 12, 46] 1 x [3, 13, 45] 1 x [45, 45] 1 x [8, 16, 38] 1 x [5, 11, 37] 1 x [11, 15, 36] 1 x [4, 27, 32] 1 x [14, 17, 32] 2 x [15, 16, 32] 1 x [8, 27, 28] 1 x [7, 28, 28] 1 x [12, 25, 26] 2 x [13, 25, 25]