Build (method = -2) #dp: 8887 Step-3' Graph: 222 vertices and 1099 arcs (0.04s) Step-4' Graph: 170 vertices and 995 arcs (0.04s) #V4/#V3 = 0.77 #A4/#A3 = 0.91 Ready! (0.04s) Optimize a model with 190 rows, 996 columns and 2657 nonzeros Presolve removed 14 rows and 23 columns Presolve time: 0.01s Presolved: 176 rows, 973 columns, 2649 nonzeros Variable types: 0 continuous, 973 integer (0 binary) Found heuristic solution: objective 713.0000000 Optimize a model with 176 rows, 973 columns and 2649 nonzeros Presolved: 176 rows, 973 columns, 2649 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.750e+03 Factor NZ : 5.602e+03 Factor Ops : 2.233e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 9.70511182e+03 -7.00878094e+04 6.94e+04 2.22e-16 2.87e+02 0s 1 2.36167801e+03 -2.95870660e+04 9.30e+03 9.99e-16 4.55e+01 0s 2 1.05728404e+03 -9.46726940e+03 1.65e+03 1.79e-14 9.53e+00 0s 3 7.12504422e+02 -1.78194528e+03 1.45e+02 2.89e-15 1.50e+00 0s 4 4.24563290e+02 -6.88757425e+02 2.36e+01 8.88e-16 5.93e-01 0s 5 2.69045572e+02 -3.28992789e+02 1.25e+01 5.55e-16 3.16e-01 0s 6 1.99509914e+02 -8.08817009e+01 7.06e+00 3.14e-16 1.48e-01 0s 7 1.66386026e+02 3.11223756e+00 3.63e+00 3.33e-16 8.53e-02 0s 8 1.53614893e+02 9.97761610e+01 2.17e+00 3.09e-16 2.83e-02 0s 9 1.47507036e+02 1.30682461e+02 9.70e-01 3.04e-16 8.84e-03 0s 10 1.39748064e+02 1.38678000e+02 7.58e-13 2.89e-16 5.44e-04 0s 11 1.39500427e+02 1.39499317e+02 1.17e-12 2.67e-16 5.64e-07 0s 12 1.39500000e+02 1.39500000e+02 3.09e-13 3.33e-16 5.70e-13 0s Barrier solved model in 12 iterations and 0.01 seconds Optimal objective 1.39500000e+02 Root relaxation: objective 1.395000e+02, 677 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 139.50000 0 19 713.00000 139.50000 80.4% - 0s H 0 0 140.0000000 139.50000 0.36% - 0s Explored 0 nodes (953 simplex iterations) in 0.06 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.05 seconds Gurobi run time: 0.06 seconds Total run time: 0.11 seconds Objective: 140 Solution: 1 x [1, 3, 7, 7, 12] 10 x [3, 7, 8, 13, 13, 20] 1 x [3, 6, 8, 9, 10, 15] 4 x [7, 8, 12, 14, 18, 19] 3 x [2, 2, 6, 7, 12, 15] 1 x [2, 2, 7, 12] 1 x [7, 12, 13, 15, 17, 17] 2 x [7, 7, 12, 12, 12, 17] 20 x [6, 11, 13, 15, 18, 20] 12 x [1, 7, 8, 14, 17, 18] 16 x [13, 14, 14, 16, 17, 18] 13 x [4, 6, 6, 6, 7, 18] 28 x [2, 2, 5, 6, 13, 20] 13 x [7, 8, 9, 15, 15, 20] 4 x [2, 2, 4, 4, 5, 7] 3 x [1, 4, 7, 7, 9, 15] 8 x [7, 7, 8, 9, 10, 15]