Build (method = -2) #dp: 4008 Step-3' Graph: 138 vertices and 1394 arcs (0.02s) Step-4' Graph: 75 vertices and 1268 arcs (0.02s) #V4/#V3 = 0.54 #A4/#A3 = 0.91 Ready! (0.02s) Optimize a model with 147 rows, 1269 columns and 3662 nonzeros Presolve removed 9 rows and 18 columns Presolve time: 0.03s Presolved: 138 rows, 1251 columns, 3562 nonzeros Variable types: 0 continuous, 1251 integer (830 binary) Found heuristic solution: objective 50.0000000 Optimize a model with 138 rows, 1251 columns and 3562 nonzeros Presolved: 138 rows, 1251 columns, 3562 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.227e+03 Factor NZ : 4.229e+03 Factor Ops : 1.825e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.27572499e+03 -1.00282144e+04 1.43e+04 2.41e-01 4.72e+01 0s 1 9.51204966e+02 -1.96572471e+03 2.81e+03 6.66e-16 9.00e+00 0s 2 1.40873441e+02 -6.44161935e+02 1.41e+02 1.44e-15 6.82e-01 0s 3 6.74029840e+01 -1.10936274e+02 1.19e+01 9.44e-16 9.39e-02 0s 4 4.34643033e+01 -3.55635779e+01 2.60e+00 1.15e-15 3.54e-02 0s 5 4.03072303e+01 1.40793675e+00 1.59e+00 1.11e-15 1.69e-02 0s 6 3.65571852e+01 2.29086199e+01 5.03e-01 1.11e-15 5.62e-03 0s 7 3.44526612e+01 2.95826391e+01 7.64e-02 1.36e-15 1.95e-03 0s 8 3.38933811e+01 3.23293245e+01 2.07e-02 1.78e-15 6.23e-04 0s 9 3.36983988e+01 3.30363516e+01 8.26e-03 1.49e-15 2.63e-04 0s 10 3.35566817e+01 3.33753434e+01 1.58e-03 1.44e-15 7.20e-05 0s 11 3.35226050e+01 3.34724436e+01 4.31e-04 1.24e-15 1.99e-05 0s 12 3.35059100e+01 3.35050000e+01 8.56e-15 8.68e-16 3.60e-07 0s 13 3.35055866e+01 3.35055866e+01 9.10e-15 1.33e-15 1.29e-11 0s Barrier solved model in 13 iterations and 0.02 seconds Optimal objective 3.35055866e+01 Root relaxation: objective 3.350559e+01, 338 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 33.50559 0 45 50.00000 33.50559 33.0% - 0s H 0 0 37.0000000 33.50559 9.44% - 0s H 0 0 34.0000000 33.50559 1.45% - 0s Explored 0 nodes (860 simplex iterations) in 0.12 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.12 seconds Total run time: 0.15 seconds Objective: 34 Solution: 1 x [7, 7] 1 x [6, 17, 36] 1 x [5, 13, 42] 1 x [5, 27, 27] 1 x [4, 27, 28] 1 x [3, 9, 48] 1 x [3, 8, 47] 1 x [2, 16, 42] 1 x [2, 22, 33] 1 x [2, 24, 32] 1 x [1, 21, 35] 1 x [11, 49, 72] 1 x [19, 41, 71] 1 x [21, 39, 70] 1 x [26, 35, 69] 1 x [18, 68] 1 x [26, 36, 67] 1 x [25, 37, 66] 1 x [8, 59, 65] 1 x [19, 44, 64] 1 x [10, 57, 63] 1 x [23, 43, 63] 1 x [15, 53, 62] 1 x [30, 31, 62] 1 x [15, 54, 61] 1 x [14, 55, 60] 1 x [20, 46, 60] 1 x [15, 52, 59] 1 x [19, 51, 58] 1 x [28, 45, 56] 1 x [12, 50, 55] 1 x [29, 45, 53] 1 x [34, 40, 51] 1 x [38, 42, 48]