Build (method = -2) #dp: 31279 Step-3' Graph: 462 vertices and 2252 arcs (0.19s) Step-4' Graph: 330 vertices and 1990 arcs (0.19s) #V4/#V3 = 0.71 #A4/#A3 = 0.88 Ready! (0.19s) Optimize a model with 349 rows, 1991 columns and 5322 nonzeros Presolve removed 58 rows and 112 columns Presolve time: 0.03s Presolved: 291 rows, 1879 columns, 5207 nonzeros Variable types: 0 continuous, 1879 integer (151 binary) Found heuristic solution: objective 199.0000000 Optimize a model with 291 rows, 1879 columns and 5207 nonzeros Presolve removed 2 rows and 2 columns Presolved: 289 rows, 1877 columns, 5218 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.151e+03 Factor NZ : 1.140e+04 Factor Ops : 6.017e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.61947522e+03 -4.70113106e+04 7.23e+04 7.92e-02 1.35e+02 0s 1 1.00767975e+03 -2.37923425e+04 9.71e+03 1.44e-15 2.16e+01 0s 2 4.53518955e+02 -9.16765918e+03 2.07e+03 4.66e-15 5.29e+00 0s 3 2.93481023e+02 -2.02056558e+03 4.04e+02 1.07e-14 1.03e+00 0s 4 2.18867501e+02 -7.37659646e+02 1.04e+02 5.16e-15 3.31e-01 0s 5 1.99380146e+02 -4.16023500e+02 4.97e+01 5.56e-15 1.91e-01 0s 6 1.86745759e+02 -3.97015471e+02 4.26e+01 5.93e-15 1.80e-01 0s 7 1.44405615e+02 -2.66029118e+02 2.27e+01 5.86e-15 1.20e-01 0s 8 1.00514018e+02 -1.85178139e+02 1.22e+01 6.54e-15 8.16e-02 0s 9 5.35151471e+01 -4.74514448e+01 5.42e+00 3.96e-15 2.89e-02 0s 10 3.57392211e+01 -2.48934545e+01 2.48e+00 6.13e-15 1.69e-02 0s 11 2.97983212e+01 -4.87846148e+00 1.61e+00 5.56e-15 9.65e-03 0s 12 2.80548285e+01 5.09664171e+00 1.10e+00 6.17e-15 6.35e-03 0s 13 2.74216902e+01 1.38874178e+01 5.95e-01 6.24e-15 3.69e-03 0s 14 2.51733991e+01 2.43637546e+01 2.14e-13 4.46e-15 2.15e-04 0s 15 2.50001671e+01 2.49984264e+01 2.33e-13 3.63e-15 4.61e-07 0s 16 2.50000002e+01 2.49999984e+01 5.68e-14 5.53e-15 4.61e-10 0s 17 2.50000000e+01 2.50000000e+01 9.05e-14 4.33e-15 4.61e-13 0s Barrier solved model in 17 iterations and 0.03 seconds Optimal objective 2.50000000e+01 Root relaxation: objective 2.500000e+01, 1256 iterations, 0.04 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 25.00000 0 40 199.00000 25.00000 87.4% - 0s H 0 0 26.0000000 25.00000 3.85% - 0s H 0 0 25.0000000 25.00000 0.0% - 0s Explored 0 nodes (2692 simplex iterations) in 0.22 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.500000000000e+01, best bound 2.500000000000e+01, gap 0.0% Preprocessing time: 0.20 seconds Gurobi run time: 0.22 seconds Total run time: 0.42 seconds Objective: 25 Solution: 2 x [8, 10, 11, 13, 15, 16, 18, 19] 2 x [3, 3, 8, 12, 13, 16, 17, 19] 1 x [3, 7, 11, 11, 12, 13, 16, 17] 2 x [3, 4, 5, 6, 9, 11, 13, 16] 4 x [3, 4, 9, 11, 11, 16, 16, 19] 1 x [3, 8, 11, 11, 13, 16, 16, 19] 1 x [1, 3, 5, 8, 8, 10, 10, 17] 4 x [1, 6, 8, 8, 10, 10, 15, 17] 1 x [3, 10, 10, 10, 10, 10, 10, 10] 1 x [2, 2, 3, 5, 5, 11, 13, 16] 2 x [1, 6, 9, 15, 15, 15, 17, 19] 4 x [1, 6, 9, 14, 14, 14, 17, 19]