Build (method = -2) #dp: 7752 Step-3' Graph: 251 vertices and 1509 arcs (0.04s) Step-4' Graph: 205 vertices and 1417 arcs (0.05s) #V4/#V3 = 0.82 #A4/#A3 = 0.94 Ready! (0.05s) Optimize a model with 225 rows, 1418 columns and 3853 nonzeros Presolve removed 16 rows and 34 columns Presolve time: 0.01s Presolved: 209 rows, 1384 columns, 3837 nonzeros Variable types: 0 continuous, 1384 integer (0 binary) Found heuristic solution: objective 680.0000000 Found heuristic solution: objective 663.0000000 Optimize a model with 209 rows, 1384 columns and 3837 nonzeros Presolved: 209 rows, 1384 columns, 3837 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.311e+03 Factor NZ : 6.493e+03 Factor Ops : 2.475e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 8.34014809e+03 -8.32422401e+04 8.96e+04 2.22e-16 2.40e+02 0s 1 2.57517398e+03 -3.48336038e+04 1.66e+04 5.55e-16 4.78e+01 0s 2 1.10058387e+03 -1.40164627e+04 2.87e+03 5.33e-15 1.05e+01 0s 3 7.68034307e+02 -3.56625017e+03 2.24e+02 5.22e-15 1.84e+00 0s 4 5.36724564e+02 -1.28938884e+03 4.11e+01 1.67e-15 6.89e-01 0s 5 5.13489752e+02 -1.11079420e+03 3.81e+01 1.55e-15 6.14e-01 0s 6 3.64737650e+02 -6.38487845e+02 2.22e+01 8.88e-16 3.75e-01 0s 7 2.85328569e+02 -2.80440584e+02 1.44e+01 5.55e-16 2.11e-01 0s 8 1.98232528e+02 -7.18332345e+01 5.37e+00 2.77e-16 9.94e-02 0s 9 1.70660910e+02 1.67402170e+01 3.46e+00 2.30e-16 5.66e-02 0s 10 1.56222035e+02 5.92017937e+01 2.19e+00 1.91e-16 3.55e-02 0s 11 1.48390322e+02 1.23988136e+02 1.15e+00 3.33e-16 9.00e-03 0s 12 1.40394354e+02 1.35598176e+02 8.01e-02 2.54e-16 1.73e-03 0s 13 1.39184363e+02 1.39134734e+02 7.75e-04 2.74e-16 1.79e-05 0s 14 1.39166667e+02 1.39166666e+02 2.08e-09 2.30e-16 1.11e-10 0s Barrier solved model in 14 iterations and 0.02 seconds Optimal objective 1.39166667e+02 Root relaxation: objective 1.391667e+02, 904 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 139.16667 0 26 663.00000 139.16667 79.0% - 0s H 0 0 140.0000000 139.16667 0.60% - 0s Explored 0 nodes (1675 simplex iterations) in 0.12 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.06 seconds Gurobi run time: 0.12 seconds Total run time: 0.18 seconds Objective: 140 Solution: 31 x [3, 12, 15, 19, 19, 20] 7 x [1, 3, 13, 15, 16, 16] 14 x [13, 15, 15, 16, 16, 16] 4 x [4, 12, 12, 17, 19, 19] 17 x [4, 12, 12, 17, 17, 19] 4 x [3, 7, 12, 12, 16, 17] 2 x [7, 12, 12, 13, 16, 16] 1 x [1, 4, 5, 13, 14] 1 x [1, 7, 8, 10, 10, 13] 10 x [1, 3, 6, 7, 10, 18] 1 x [1, 3, 7, 10, 18] 15 x [1, 3, 6, 6, 7, 10] 3 x [1, 1, 4, 5, 13, 14] 1 x [4, 14, 14, 18, 20] 8 x [4, 14, 14, 18, 20, 20] 9 x [2, 3, 13, 18, 20, 20] 1 x [8, 14, 18, 18] 1 x [8, 8, 11, 13, 18, 18] 10 x [9, 10, 11, 13, 18, 18]