Build (method = -2) #dp: 4137 Step-3' Graph: 104 vertices and 1065 arcs (0.02s) Step-4' Graph: 68 vertices and 993 arcs (0.02s) #V4/#V3 = 0.65 #A4/#A3 = 0.93 Ready! (0.02s) Optimize a model with 132 rows, 994 columns and 2852 nonzeros Presolve removed 23 rows and 32 columns Presolve time: 0.03s Presolved: 109 rows, 962 columns, 2750 nonzeros Variable types: 0 continuous, 962 integer (517 binary) Found heuristic solution: objective 91.0000000 Optimize a model with 109 rows, 962 columns and 2750 nonzeros Presolved: 109 rows, 962 columns, 2750 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.716e+03 Factor NZ : 3.314e+03 Factor Ops : 1.396e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.78710251e+03 -5.39010118e+03 7.20e+03 2.63e-01 2.06e+01 0s 1 7.33358912e+02 -1.32694098e+03 1.38e+03 4.44e-16 3.94e+00 0s 2 1.60468245e+02 -4.00005823e+02 1.33e+02 5.55e-16 5.29e-01 0s 3 7.19488698e+01 -3.23241204e+01 6.60e+00 5.55e-16 6.18e-02 0s 4 5.42591867e+01 1.58789940e+01 1.21e+00 2.57e-16 2.05e-02 0s 5 5.07725008e+01 3.25190962e+01 6.65e-01 1.62e-16 9.58e-03 0s 6 4.77303643e+01 4.11197280e+01 1.48e-01 2.42e-16 3.41e-03 0s 7 4.67704708e+01 4.39072508e+01 5.25e-02 2.22e-16 1.47e-03 0s 8 4.60329512e+01 4.49867879e+01 2.03e-03 2.22e-16 5.38e-04 0s 9 4.59159661e+01 4.54410570e+01 7.42e-04 2.22e-16 2.44e-04 0s 10 4.58415799e+01 4.56437059e+01 1.58e-04 2.22e-16 1.02e-04 0s 11 4.58052295e+01 4.57633697e+01 8.53e-06 3.33e-16 2.15e-05 0s 12 4.58025811e+01 4.57828597e+01 4.19e-06 2.22e-16 1.01e-05 0s 13 4.58008512e+01 4.57993918e+01 6.15e-07 4.44e-16 7.50e-07 0s 14 4.58000018e+01 4.57999967e+01 2.09e-09 3.33e-16 2.62e-09 0s 15 4.58000000e+01 4.58000000e+01 1.74e-12 2.97e-16 2.82e-15 0s Barrier solved model in 15 iterations and 0.01 seconds Optimal objective 4.58000000e+01 Root relaxation: objective 4.580000e+01, 349 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 45.80000 0 18 91.00000 45.80000 49.7% - 0s H 0 0 47.0000000 45.80000 2.55% - 0s H 0 0 46.0000000 45.80000 0.43% - 0s Explored 0 nodes (550 simplex iterations) in 0.07 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 4.600000000000e+01, best bound 4.600000000000e+01, gap 0.0% Preprocessing time: 0.04 seconds Gurobi run time: 0.07 seconds Total run time: 0.11 seconds Objective: 46 Solution: 1 x [26, 64] 1 x [4, 7, 64] 1 x [27, 63] 1 x [29, 62] 1 x [30, 61] 1 x [5, 11, 61] 1 x [31, 60] 2 x [32, 59] 1 x [6, 10, 59] 1 x [33, 58] 1 x [2, 16, 58] 3 x [1, 18, 57] 1 x [35, 56] 1 x [9, 12, 56] 1 x [37, 55] 1 x [38, 54] 1 x [11, 13, 54] 1 x [41, 53] 2 x [2, 24, 53] 1 x [42, 52] 1 x [8, 18, 52] 1 x [2, 25, 51] 1 x [43, 50] 1 x [13, 15, 50] 1 x [6, 23, 49] 1 x [2, 27, 48] 2 x [45, 47] 1 x [27, 46] 1 x [14, 16, 46] 1 x [44, 45] 2 x [15, 17, 45] 1 x [13, 23, 44] 3 x [3, 36, 40] 1 x [18, 22, 40] 1 x [19, 21, 40] 1 x [1, 39, 39] 1 x [8, 34, 36] 1 x [20, 28, 28]