Build (method = -2) #dp: 857 Step-3' Graph: 32 vertices and 179 arcs (0.00s) Step-4' Graph: 29 vertices and 173 arcs (0.00s) #V4/#V3 = 0.91 #A4/#A3 = 0.97 Ready! (0.00s) Optimize a model with 97 rows, 174 columns and 469 nonzeros Presolve removed 52 rows and 54 columns Presolve time: 0.00s Presolved: 45 rows, 120 columns, 310 nonzeros Variable types: 0 continuous, 120 integer (1 binary) Found heuristic solution: objective 190.0000000 Found heuristic solution: objective 173.0000000 Found heuristic solution: objective 143.0000000 Optimize a model with 45 rows, 120 columns and 310 nonzeros Presolve removed 1 rows and 1 columns Presolved: 44 rows, 119 columns, 308 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.400e+02 Factor NZ : 4.940e+02 Factor Ops : 6.810e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.02904373e+03 -1.58163013e+03 8.04e+02 1.11e-16 3.72e+01 0s 1 3.47524678e+02 -4.56900193e+02 9.59e+01 6.66e-16 5.56e+00 0s 2 1.86968243e+02 3.73679508e+01 9.29e-02 1.93e-14 5.85e-01 0s 3 1.59805171e+02 1.14764968e+02 3.30e-04 4.44e-15 1.76e-01 0s 4 1.41549387e+02 1.35476724e+02 3.92e-05 1.18e-15 2.37e-02 0s 5 1.40636498e+02 1.38237804e+02 1.64e-05 1.22e-15 9.37e-03 0s 6 1.40307901e+02 1.38494401e+02 1.16e-05 1.39e-15 7.08e-03 0s 7 1.39699200e+02 1.39003295e+02 3.35e-06 1.12e-15 2.72e-03 0s 8 1.39518101e+02 1.39463561e+02 1.46e-07 1.33e-15 2.13e-04 0s 9 1.39500067e+02 1.39499813e+02 2.83e-10 6.69e-16 9.92e-07 0s 10 1.39500000e+02 1.39500000e+02 1.91e-14 7.77e-16 9.92e-10 0s 11 1.39500000e+02 1.39500000e+02 1.42e-14 1.22e-15 9.92e-13 0s Barrier solved model in 11 iterations and 0.00 seconds Optimal objective 1.39500000e+02 Root relaxation: objective 1.395000e+02, 30 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 139.50000 0 1 143.00000 139.50000 2.45% - 0s H 0 0 140.0000000 139.50000 0.36% - 0s Explored 0 nodes (32 simplex iterations) in 0.01 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.400000000000e+02, best bound 1.400000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.01 seconds Total run time: 0.02 seconds Objective: 140 Solution: 3 x [68] 2 x [67] 3 x [66] 2 x [65] 5 x [64] 1 x [63] 3 x [62] 3 x [61] 3 x [60] 5 x [59] 5 x [58] 4 x [57] 4 x [56] 4 x [55] 1 x [54] 1 x [53] 4 x [52] 4 x [51] 5 x [50] 2 x [49] 2 x [48] 1 x [47] 5 x [46] 1 x [45] 3 x [44] 2 x [43] 3 x [42] 1 x [41] 1 x [1, 40] 1 x [2, 39] 4 x [3, 38] 1 x [2, 38] 3 x [4, 37] 3 x [5, 36] 1 x [6, 35] 2 x [7, 34] 1 x [6, 34] 2 x [8, 33] 3 x [9, 32] 1 x [9, 31] 2 x [10, 30] 2 x [11, 29] 1 x [10, 29] 4 x [12, 28] 1 x [13, 27] 2 x [14, 26] 3 x [15, 25] 1 x [16, 24] 2 x [15, 24] 2 x [17, 23] 1 x [13, 23] 2 x [18, 22] 1 x [19, 21] 1 x [10, 21] 1 x [20] 3 x [19, 20] 1 x [20, 20] 2 x [8, 10] 1 x [2, 2, 9] 1 x [2, 4, 7] 1 x [1, 6, 6]