Build (method = -2) #dp: 4259 Step-3' Graph: 106 vertices and 1913 arcs (0.01s) Step-4' Graph: 105 vertices and 1911 arcs (0.02s) #V4/#V3 = 0.99 #A4/#A3 = 1.00 Ready! (0.02s) Optimize a model with 173 rows, 1912 columns and 5530 nonzeros Presolve removed 35 rows and 35 columns Presolve time: 0.03s Presolved: 138 rows, 1877 columns, 5476 nonzeros Variable types: 0 continuous, 1877 integer (1199 binary) Found heuristic solution: objective 66.0000000 Optimize a model with 138 rows, 1877 columns and 5476 nonzeros Presolved: 138 rows, 1877 columns, 5476 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.151e+03 Factor NZ : 6.408e+03 Factor Ops : 3.989e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.81079317e+03 -8.00388792e+03 4.54e+03 1.80e-01 2.69e+01 0s 1 1.19611597e+03 -3.12788291e+03 8.60e+02 5.55e-16 5.40e+00 0s 2 2.22041288e+02 -9.80879327e+02 6.48e+01 8.88e-16 6.09e-01 0s 3 8.93662342e+01 -1.11598041e+02 4.09e+00 7.77e-16 6.64e-02 0s 4 6.64932777e+01 -9.38557899e+00 1.34e+00 3.47e-16 2.29e-02 0s 5 5.42087083e+01 1.58007514e+01 5.46e-01 3.33e-16 1.10e-02 0s 6 5.08987831e+01 2.74624675e+01 3.70e-01 3.33e-16 6.61e-03 0s 7 4.75113767e+01 3.43058662e+01 2.37e-01 2.32e-16 3.70e-03 0s 8 4.41167177e+01 3.76320733e+01 1.22e-01 2.75e-16 1.81e-03 0s 9 4.27584619e+01 3.88047294e+01 7.17e-02 3.15e-16 1.10e-03 0s 10 4.20729362e+01 3.94623131e+01 4.27e-02 3.25e-16 7.18e-04 0s 11 4.10689630e+01 4.00808048e+01 9.11e-03 2.69e-16 2.66e-04 0s 12 4.08707607e+01 4.03594283e+01 4.09e-03 2.76e-16 1.37e-04 0s 13 4.08234685e+01 4.05152346e+01 2.76e-03 2.86e-16 8.23e-05 0s 14 4.07914611e+01 4.05674649e+01 1.63e-03 3.93e-16 5.96e-05 0s 15 4.07545041e+01 4.06262350e+01 4.30e-04 1.88e-15 3.40e-05 0s 16 4.07389640e+01 4.06928773e+01 1.04e-04 1.29e-15 1.22e-05 0s 17 4.07347831e+01 4.07064961e+01 5.31e-05 1.34e-15 7.50e-06 0s 18 4.07290606e+01 4.07219063e+01 5.30e-06 1.17e-15 1.90e-06 0s 19 4.07266231e+01 4.07263515e+01 4.62e-13 1.13e-15 7.20e-08 0s 20 4.07264959e+01 4.07264956e+01 7.93e-13 1.35e-15 7.30e-11 0s 21 4.07264957e+01 4.07264957e+01 1.13e-12 1.46e-15 1.19e-16 0s Barrier solved model in 21 iterations and 0.03 seconds Optimal objective 4.07264957e+01 Root relaxation: objective 4.072650e+01, 221 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 40.72650 0 36 66.00000 40.72650 38.3% - 0s H 0 0 42.0000000 40.72650 3.03% - 0s H 0 0 41.0000000 40.72650 0.67% - 0s Explored 0 nodes (853 simplex iterations) in 0.13 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 4.100000000000e+01, best bound 4.100000000000e+01, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.13 seconds Total run time: 0.16 seconds Objective: 41 Solution: 1 x [15, 68] 1 x [1, 9, 68] 1 x [18, 67] 1 x [19, 66] 1 x [20, 65] 1 x [18, 65] 1 x [22, 64] 1 x [21, 64] 1 x [23, 63] 2 x [25, 62] 1 x [4, 8, 12, 62] 1 x [26, 61] 2 x [27, 60] 1 x [3, 24, 59] 1 x [13, 14, 58] 1 x [10, 17, 57] 1 x [28, 56] 1 x [31, 55] 1 x [3, 29, 55] 1 x [2, 28, 55] 1 x [14, 19, 55] 1 x [32, 54] 1 x [5, 31, 53] 1 x [6, 30, 53] 1 x [37, 52] 1 x [38, 51] 1 x [39, 50] 1 x [2, 38, 49] 1 x [2, 37, 49] 2 x [40, 48] 1 x [41, 47] 1 x [44, 46] 1 x [45, 45] 1 x [7, 41, 43] 1 x [11, 36, 42] 1 x [16, 34, 39] 1 x [8, 33, 35] 1 x [19, 35, 35]