Build (method = -2) #dp: 7634 Step-3' Graph: 59 vertices and 1329 arcs (0.05s) Step-4' Graph: 48 vertices and 1307 arcs (0.05s) #V4/#V3 = 0.81 #A4/#A3 = 0.98 Ready! (0.05s) Optimize a model with 128 rows, 1308 columns and 3835 nonzeros Presolve removed 4 rows and 4 columns Presolve time: 0.01s Presolved: 124 rows, 1304 columns, 3825 nonzeros Variable types: 0 continuous, 1304 integer (91 binary) Found heuristic solution: objective 458.0000000 Found heuristic solution: objective 417.0000000 Optimize a model with 124 rows, 1304 columns and 3825 nonzeros Presolved: 124 rows, 1304 columns, 3825 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.737e+03 Factor NZ : 3.293e+03 Factor Ops : 1.142e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.35592181e+04 -2.07507603e+04 1.25e+04 7.11e-02 1.20e+02 0s 1 3.29590258e+03 -9.44583682e+03 1.71e+03 5.55e-16 1.87e+01 0s 2 7.62074367e+02 -4.33230342e+03 1.78e+02 5.26e-14 3.10e+00 0s 3 4.31126722e+02 -6.46310671e+02 1.43e+01 8.88e-15 4.37e-01 0s 4 2.41963883e+02 -1.86803896e+02 2.29e+00 3.22e-15 1.63e-01 0s 5 1.43607156e+02 -6.46315359e+01 1.11e+00 1.33e-15 7.88e-02 0s 6 1.03617862e+02 3.96674292e+01 4.47e-01 3.33e-16 2.40e-02 0s 7 9.46762861e+01 6.73855252e+01 2.36e-01 3.82e-16 1.02e-02 0s 8 8.54546276e+01 8.07119792e+01 2.71e-02 3.33e-16 1.77e-03 0s 9 8.40712223e+01 8.39468695e+01 6.02e-04 3.50e-16 4.63e-05 0s 10 8.40333711e+01 8.40332469e+01 1.24e-13 3.42e-16 4.63e-08 0s 11 8.40333333e+01 8.40333333e+01 6.98e-14 3.33e-16 4.64e-14 0s Barrier solved model in 11 iterations and 0.01 seconds Optimal objective 8.40333333e+01 Root relaxation: objective 8.403333e+01, 1086 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 84.03333 0 37 417.00000 84.03333 79.8% - 0s H 0 0 86.0000000 84.03333 2.29% - 0s H 0 0 85.0000000 84.03333 1.14% - 0s Explored 0 nodes (1503 simplex iterations) in 0.11 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 8.500000000000e+01, best bound 8.500000000000e+01, gap 0.0% Preprocessing time: 0.07 seconds Gurobi run time: 0.11 seconds Total run time: 0.18 seconds Objective: 85 Solution: 1 x [8, 69, 75] 1 x [2, 10, 15, 45, 65] 5 x [19, 24, 33, 38, 63] 3 x [2, 22, 32, 33, 40, 76] 3 x [5, 22, 24, 29, 36, 58] 4 x [1, 2, 26, 29, 45, 60] 3 x [6, 8, 11, 19, 23, 34] 1 x [4, 5, 9, 10, 67] 1 x [5, 6, 9, 10, 28, 48] 5 x [4, 23, 48, 63, 67, 68] 2 x [4, 11, 31, 53, 60, 80] 2 x [11, 14, 42, 46, 71, 75] 2 x [7, 39, 41, 58, 75, 79] 1 x [22, 27, 44, 45, 68] 2 x [15, 28, 56, 67, 68] 2 x [10, 14, 42, 45, 47, 78] 4 x [35, 47, 62, 66, 70, 71] 2 x [13, 32, 43, 47, 54, 80] 1 x [9, 10, 44, 45, 57] 3 x [18, 32, 43, 44, 46, 73] 3 x [28, 49, 66, 74] 6 x [8, 21, 37, 78] 3 x [12, 22, 30, 60, 66, 72] 1 x [37, 38, 39, 60, 77] 1 x [1, 30, 37, 51, 52, 79] 1 x [2, 18, 43, 46, 48] 5 x [3, 35, 55, 59, 61, 70] 1 x [38, 39, 59, 61, 64] 1 x [26, 51, 55, 58, 61, 79] 2 x [26, 31, 58, 59, 73, 79] 3 x [25, 39, 43, 55, 64, 77] 5 x [1, 7, 16, 31, 53, 73] 1 x [17, 20, 38, 39, 45, 64] 2 x [13, 16, 20, 20, 38, 64] 2 x [13, 20, 20, 50, 51, 74]