Build (method = -2) #dp: 14260 Step-3' Graph: 167 vertices and 651 arcs (0.07s) Step-4' Graph: 100 vertices and 517 arcs (0.07s) #V4/#V3 = 0.60 #A4/#A3 = 0.79 Ready! (0.07s) Optimize a model with 119 rows, 518 columns and 1358 nonzeros Presolve removed 22 rows and 41 columns Presolve time: 0.01s Presolved: 97 rows, 477 columns, 1295 nonzeros Variable types: 0 continuous, 477 integer (27 binary) Found heuristic solution: objective 183.0000000 Found heuristic solution: objective 174.0000000 Optimize a model with 97 rows, 477 columns and 1295 nonzeros Presolved: 97 rows, 477 columns, 1295 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 7.380e+02 Factor NZ : 2.213e+03 Factor Ops : 5.751e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.35156443e+03 -2.03710270e+04 1.72e+04 4.36e-02 2.01e+02 0s 1 1.08833848e+03 -7.89734726e+03 2.69e+03 7.77e-16 3.36e+01 0s 2 2.96648587e+02 -3.18653537e+03 2.88e+02 1.33e-15 5.66e+00 0s 3 1.81746631e+02 -5.81441995e+02 1.25e+01 1.13e-14 8.33e-01 0s 4 1.26468859e+02 -1.84442756e+02 5.97e-01 4.55e-15 3.21e-01 0s 5 6.70509246e+01 -6.18790665e+01 2.10e-01 1.55e-15 1.33e-01 0s 6 4.43597404e+01 -2.83041039e+01 1.02e-01 9.99e-16 7.50e-02 0s 7 3.86104117e+01 1.21595909e+01 6.15e-02 2.39e-16 2.73e-02 0s 8 3.54891724e+01 2.86900330e+01 2.77e-02 2.22e-16 7.02e-03 0s 9 3.34855895e+01 3.30765416e+01 1.29e-03 2.46e-16 4.22e-04 0s 10 3.33334917e+01 3.33330747e+01 6.02e-14 2.22e-16 4.30e-07 0s 11 3.33333335e+01 3.33333331e+01 4.04e-14 3.33e-16 4.30e-10 0s 12 3.33333333e+01 3.33333333e+01 4.54e-14 2.59e-16 4.30e-13 0s Barrier solved model in 12 iterations and 0.01 seconds Optimal objective 3.33333333e+01 Root relaxation: objective 3.333333e+01, 321 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 33.33333 0 14 174.00000 33.33333 80.8% - 0s H 0 0 39.0000000 33.33333 14.5% - 0s H 0 0 34.0000000 33.33333 1.96% - 0s Explored 0 nodes (547 simplex iterations) in 0.03 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 3.400000000000e+01, best bound 3.400000000000e+01, gap 0.0% Preprocessing time: 0.08 seconds Gurobi run time: 0.03 seconds Total run time: 0.11 seconds Objective: 34 Solution: 1 x [3, 5, 9, 11, 13, 18] 3 x [3, 5, 10, 11, 16, 18] 5 x [1, 4, 5, 6, 12, 18] 1 x [5, 9, 15, 17, 18] 1 x [1, 2, 5, 15, 17, 18] 9 x [3, 9, 10, 11, 12, 14] 1 x [5, 5, 12, 15, 19] 1 x [4, 7, 7, 7, 7] 3 x [4, 7, 7, 7, 7, 7] 1 x [4, 4, 5, 8, 15] 1 x [4, 4, 4, 5, 8, 15] 7 x [2, 6, 8, 15, 16, 17]