Build (method = -2) #dp: 4143 Step-3' Graph: 101 vertices and 757 arcs (0.02s) Step-4' Graph: 69 vertices and 693 arcs (0.02s) #V4/#V3 = 0.68 #A4/#A3 = 0.92 Ready! (0.02s) Optimize a model with 138 rows, 694 columns and 1948 nonzeros Presolve removed 42 rows and 57 columns Presolve time: 0.02s Presolved: 96 rows, 637 columns, 1817 nonzeros Variable types: 0 continuous, 637 integer (428 binary) Found heuristic solution: objective 69.0000000 Optimize a model with 96 rows, 637 columns and 1817 nonzeros Presolved: 96 rows, 637 columns, 1817 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.241e+03 Factor NZ : 2.520e+03 Factor Ops : 8.126e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.50557788e+03 -4.91045377e+03 3.50e+03 2.67e-01 2.35e+01 0s 1 4.41101196e+02 -1.12593000e+03 6.22e+02 7.77e-16 4.20e+00 0s 2 1.20785005e+02 -2.42937279e+02 5.77e+01 1.33e-15 5.25e-01 0s 3 6.82779801e+01 -1.91601993e+01 3.47e+00 2.78e-16 7.78e-02 0s 4 5.81415724e+01 2.50804904e+01 6.33e-01 4.44e-16 2.65e-02 0s 5 5.38355166e+01 3.46583520e+01 2.79e-01 2.22e-16 1.51e-02 0s 6 5.06406214e+01 3.99331432e+01 9.32e-02 4.44e-16 8.38e-03 0s 7 4.89987289e+01 4.42467062e+01 3.52e-02 4.44e-16 3.71e-03 0s 8 4.77214324e+01 4.61482128e+01 6.43e-03 2.22e-16 1.23e-03 0s 9 4.75138031e+01 4.63831090e+01 2.78e-03 2.71e-16 8.80e-04 0s 10 4.73700585e+01 4.71868361e+01 4.19e-04 3.00e-16 1.43e-04 0s 11 4.73348810e+01 4.73204260e+01 2.67e-06 2.22e-16 1.12e-05 0s 12 4.73333349e+01 4.73333204e+01 1.77e-13 4.44e-16 1.13e-08 0s 13 4.73333333e+01 4.73333333e+01 1.22e-13 3.33e-16 1.20e-14 0s Barrier solved model in 13 iterations and 0.01 seconds Optimal objective 4.73333333e+01 Root relaxation: objective 4.733333e+01, 231 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 47.33333 0 16 69.00000 47.33333 31.4% - 0s H 0 0 49.0000000 47.33333 3.40% - 0s H 0 0 48.0000000 47.33333 1.39% - 0s Explored 0 nodes (354 simplex iterations) in 0.05 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 4.800000000000e+01, best bound 4.800000000000e+01, gap 0.0% Preprocessing time: 0.04 seconds Gurobi run time: 0.05 seconds Total run time: 0.09 seconds Objective: 48 Solution: 1 x [69] 1 x [68] 2 x [67] 1 x [3, 66] 1 x [3, 65] 1 x [6, 64] 1 x [7, 63] 1 x [10, 62] 1 x [1, 9, 62] 1 x [11, 61] 1 x [12, 60] 1 x [15, 59] 1 x [13, 59] 1 x [12, 59] 2 x [5, 8, 59] 1 x [16, 58] 1 x [19, 57] 1 x [18, 57] 1 x [14, 56] 1 x [20, 55] 1 x [20, 54] 1 x [22, 53] 1 x [21, 53] 1 x [23, 52] 1 x [26, 51] 1 x [28, 50] 1 x [27, 50] 1 x [25, 50] 2 x [29, 49] 1 x [30, 48] 1 x [32, 47] 1 x [31, 46] 1 x [34, 45] 1 x [35, 44] 1 x [35, 43] 1 x [2, 29, 42] 1 x [38, 41] 1 x [38, 40] 1 x [4, 35, 39] 1 x [20, 38] 1 x [6, 33, 37] 1 x [35, 36] 1 x [17, 30, 32] 1 x [16, 29, 30] 1 x [24, 30]