Build (method = -2) #dp: 21328 Step-3' Graph: 365 vertices and 1710 arcs (0.11s) Step-4' Graph: 260 vertices and 1501 arcs (0.11s) #V4/#V3 = 0.71 #A4/#A3 = 0.88 Ready! (0.11s) Optimize a model with 279 rows, 1502 columns and 3995 nonzeros Presolve removed 40 rows and 80 columns Presolve time: 0.02s Presolved: 239 rows, 1422 columns, 3926 nonzeros Variable types: 0 continuous, 1422 integer (74 binary) Found heuristic solution: objective 113.0000000 Optimize a model with 239 rows, 1422 columns and 3926 nonzeros Presolved: 239 rows, 1422 columns, 3926 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.354e+03 Factor NZ : 6.761e+03 Factor Ops : 2.325e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.33726157e+03 -2.70736994e+04 3.15e+04 6.29e-02 8.08e+01 0s 1 5.69071826e+02 -1.11783083e+04 4.53e+03 7.77e-16 1.33e+01 0s 2 2.79493524e+02 -4.31390192e+03 1.01e+03 8.88e-16 3.37e+00 0s 3 1.99116693e+02 -1.02140247e+03 1.29e+02 8.05e-16 5.88e-01 0s 4 1.59587389e+02 -2.76171017e+02 3.07e+01 5.55e-16 1.76e-01 0s 5 1.29671916e+02 -1.32716090e+02 2.42e+01 4.37e-16 1.07e-01 0s 6 7.68804703e+01 -8.04315045e+01 1.18e+01 3.05e-16 6.17e-02 0s 7 5.85367150e+01 -2.37639015e+01 7.92e+00 3.11e-16 3.26e-02 0s 8 3.85595235e+01 -1.19201768e-01 3.06e+00 2.22e-16 1.48e-02 0s 9 3.36472957e+01 1.30850345e+01 1.80e+00 3.33e-16 7.78e-03 0s 10 3.11057328e+01 2.01214432e+01 1.06e+00 2.23e-16 4.12e-03 0s 11 2.92173729e+01 2.67236983e+01 3.00e-01 2.70e-16 9.21e-04 0s 12 2.92357727e+01 2.73046730e+01 2.76e-01 2.70e-16 7.16e-04 0s 13 2.86164845e+01 2.84012204e+01 1.40e-13 4.44e-16 7.52e-05 0s 14 2.85718851e+01 2.85702979e+01 2.21e-13 3.04e-16 5.55e-07 0s 15 2.85714286e+01 2.85714286e+01 1.14e-13 2.53e-16 2.04e-12 0s Barrier solved model in 15 iterations and 0.02 seconds Optimal objective 2.85714286e+01 Root relaxation: objective 2.857143e+01, 978 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 28.57143 0 14 113.00000 28.57143 74.7% - 0s H 0 0 29.0000000 28.57143 1.48% - 0s Explored 0 nodes (1385 simplex iterations) in 0.10 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.900000000000e+01, best bound 2.900000000000e+01, gap 0.0% Preprocessing time: 0.13 seconds Gurobi run time: 0.10 seconds Total run time: 0.22 seconds Objective: 29 Solution: 2 x [2, 3, 4, 6, 16, 17, 19] 1 x [6, 14, 14, 16, 18, 19] 2 x [6, 14, 14, 16, 18, 18, 19] 7 x [3, 6, 7, 7, 7, 9, 18] 5 x [6, 7, 10, 14, 14, 16, 18] 1 x [2, 2, 6, 6, 9, 10] 2 x [5, 7, 10, 12, 14, 14, 19] 5 x [1, 10, 12, 12, 12, 13, 19] 1 x [1, 2, 2, 4, 9, 10, 19] 1 x [2, 10, 11, 13, 15, 19, 19] 1 x [1, 1, 8, 10, 12, 13] 1 x [2, 3, 3, 4, 8, 11, 16]