Build (method = -2) #dp: 27832 Step-3' Graph: 740 vertices and 4381 arcs (0.16s) Step-4' Graph: 655 vertices and 4213 arcs (0.17s) #V4/#V3 = 0.89 #A4/#A3 = 0.96 Ready! (0.17s) Optimize a model with 674 rows, 4214 columns and 11341 nonzeros Presolve removed 68 rows and 129 columns Presolve time: 0.05s Presolved: 606 rows, 4085 columns, 11276 nonzeros Variable types: 0 continuous, 4085 integer (0 binary) Found heuristic solution: objective 191.0000000 Optimize a model with 606 rows, 4085 columns and 11276 nonzeros Presolved: 606 rows, 4085 columns, 11276 nonzeros Root barrier log... Ordering time: 0.01s Barrier statistics: AA' NZ : 6.978e+03 Factor NZ : 3.222e+04 (roughly 2 MBytes of memory) Factor Ops : 2.612e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.42102034e+03 -1.03670812e+05 1.31e+05 2.22e-16 1.67e+02 0s 1 7.89640354e+02 -5.79456256e+04 1.71e+04 1.33e-15 2.58e+01 0s 2 3.82987999e+02 -2.45354463e+04 4.32e+03 7.33e-15 7.12e+00 0s 3 2.60633054e+02 -1.14797166e+04 1.35e+03 1.33e-15 2.51e+00 0s 4 2.19213600e+02 -3.22972611e+03 4.34e+02 2.98e-14 7.07e-01 0s 5 2.01919149e+02 -9.95151381e+02 5.38e+01 4.66e-15 1.72e-01 0s 6 1.98742619e+02 -2.94437043e+02 2.27e-01 2.66e-15 6.03e-02 0s 7 1.64497082e+02 -3.42085266e+02 1.44e-01 2.89e-15 6.19e-02 0s 8 1.23489300e+02 -1.69172939e+02 4.70e-02 1.33e-15 3.58e-02 0s 9 1.00720425e+02 -1.09093689e+02 3.54e-02 8.51e-16 2.56e-02 0s 10 8.43735661e+01 -8.79191753e+01 2.77e-02 9.38e-16 2.10e-02 0s 11 6.48500293e+01 -7.13671506e+01 1.97e-02 1.15e-15 1.66e-02 0s 12 5.69776141e+01 -6.22695906e+01 1.66e-02 1.16e-15 1.46e-02 0s 13 5.05266178e+01 -4.49660634e+01 1.41e-02 1.18e-15 1.17e-02 0s 14 3.80744310e+01 -1.89075031e+01 8.53e-03 8.74e-16 6.96e-03 0s 15 3.19353383e+01 2.96167047e+00 5.38e-03 6.32e-16 3.54e-03 0s 16 2.75712057e+01 1.17451225e+01 2.76e-03 6.52e-16 1.93e-03 0s 17 2.71912276e+01 2.01407700e+01 1.89e-03 5.42e-16 8.61e-04 0s 18 2.61704002e+01 2.28862341e+01 5.21e-04 6.55e-16 4.01e-04 0s 19 2.50911490e+01 2.44640353e+01 3.91e-05 4.60e-16 7.66e-05 0s 20 2.50005569e+01 2.49956739e+01 1.28e-12 5.67e-16 5.96e-07 0s 21 2.50000006e+01 2.49999957e+01 6.37e-13 4.44e-16 5.96e-10 0s 22 2.50000000e+01 2.50000000e+01 3.72e-13 4.66e-16 5.96e-13 0s Barrier solved model in 22 iterations and 0.11 seconds Optimal objective 2.50000000e+01 Root relaxation: objective 2.500000e+01, 2772 iterations, 0.14 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 25.00000 0 45 191.00000 25.00000 86.9% - 0s H 0 0 26.0000000 25.00000 3.85% - 0s H 0 0 25.0000000 25.00000 0.0% - 0s Explored 0 nodes (6165 simplex iterations) in 0.70 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.19 seconds Gurobi run time: 0.70 seconds Total run time: 0.89 seconds Objective: 25 Solution: 1 x [2, 4, 11, 12, 14, 16, 17, 19] 1 x [3, 5, 7, 7, 11, 13, 15, 19] 3 x [2, 3, 4, 7, 10, 11, 13, 19] 4 x [3, 8, 15, 15, 16, 17, 18, 18] 1 x [3, 6, 6, 8, 10, 13, 18, 18] 3 x [1, 3, 5, 7, 8, 10, 10, 13] 1 x [3, 5, 7, 7, 11, 13, 15, 17] 1 x [5, 5, 7, 7, 11, 12, 13, 19] 1 x [4, 5, 7, 7, 10, 12, 13, 19] 1 x [6, 6, 6, 6, 10, 11, 13, 19] 3 x [5, 5, 9, 16, 16, 19, 19, 19] 5 x [2, 4, 4, 11, 12, 16, 17, 17]