Build (method = -2) #dp: 30210 Step-3' Graph: 711 vertices and 3644 arcs (0.17s) Step-4' Graph: 595 vertices and 3416 arcs (0.18s) #V4/#V3 = 0.84 #A4/#A3 = 0.94 Ready! (0.18s) Optimize a model with 614 rows, 3417 columns and 9068 nonzeros Presolve removed 48 rows and 97 columns Presolve time: 0.03s Presolved: 566 rows, 3320 columns, 8991 nonzeros Variable types: 0 continuous, 3320 integer (0 binary) Found heuristic solution: objective 184.0000000 Optimize a model with 566 rows, 3320 columns and 8991 nonzeros Presolved: 566 rows, 3320 columns, 8991 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.695e+03 Factor NZ : 2.349e+04 (roughly 2 MBytes of memory) Factor Ops : 1.374e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.33285381e+03 -8.22832197e+04 7.72e+04 1.11e-16 1.06e+02 0s 1 6.07741637e+02 -4.57040544e+04 1.17e+04 9.99e-16 1.99e+01 0s 2 3.70986915e+02 -1.70044092e+04 3.80e+03 1.33e-15 6.25e+00 0s 3 2.36483655e+02 -4.98940637e+03 7.66e+02 1.55e-15 1.41e+00 0s 4 2.05803233e+02 -2.46779877e+03 1.46e+02 5.11e-15 5.01e-01 0s 5 1.98046798e+02 -9.30988022e+02 6.70e-02 3.33e-15 1.70e-01 0s 6 1.89433164e+02 -4.63558435e+02 1.66e-11 1.78e-15 9.81e-02 0s 7 1.42674226e+02 -3.12087180e+02 9.87e-12 1.11e-15 6.83e-02 0s 8 1.29888855e+02 -1.78865216e+02 8.70e-12 6.66e-16 4.64e-02 0s 9 1.03441616e+02 -1.56938412e+02 6.40e-12 6.66e-16 3.91e-02 0s 10 6.84497225e+01 -9.44202889e+01 3.97e-12 4.43e-16 2.45e-02 0s 11 5.29398940e+01 -8.11136259e+01 2.89e-12 5.14e-16 2.01e-02 0s 12 4.06742047e+01 -4.92976784e+01 1.83e-12 4.52e-16 1.35e-02 0s 13 3.43695009e+01 -1.82600158e+01 1.14e-12 3.92e-16 7.90e-03 0s 14 3.17609393e+01 3.63792457e+00 8.81e-13 3.24e-16 4.22e-03 0s 15 2.79636041e+01 1.61730030e+01 3.91e-13 3.22e-16 1.77e-03 0s 16 2.63553627e+01 2.25586711e+01 6.40e-13 3.46e-16 5.70e-04 0s 17 2.58446731e+01 2.44544930e+01 5.35e-13 2.76e-16 2.09e-04 0s 18 2.56866186e+01 2.46901255e+01 1.49e-13 2.87e-16 1.50e-04 0s 19 2.50633433e+01 2.48714616e+01 6.70e-13 3.49e-16 2.88e-05 0s 20 2.50003930e+01 2.49994923e+01 2.01e-13 3.76e-16 1.35e-07 0s 21 2.50000004e+01 2.49999995e+01 1.97e-13 2.80e-16 1.35e-10 0s 22 2.50000000e+01 2.50000000e+01 4.10e-13 3.03e-16 1.35e-13 0s Barrier solved model in 22 iterations and 0.08 seconds Optimal objective 2.50000000e+01 Root relaxation: objective 2.500000e+01, 2110 iterations, 0.10 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 25.00000 0 56 184.00000 25.00000 86.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 (3781 simplex iterations) in 0.37 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.37 seconds Total run time: 0.57 seconds Objective: 25 Solution: 3 x [1, 1, 4, 5, 14, 15, 16, 16] 2 x [3, 5, 8, 10, 11, 15, 19, 19] 6 x [3, 4, 4, 5, 8, 11, 18, 18] 1 x [2, 2, 5, 6, 7, 10, 16, 19] 2 x [1, 3, 4, 5, 10, 12, 12, 14] 2 x [3, 6, 11, 11, 12, 15, 16, 18] 1 x [1, 4, 8, 10, 10, 11, 15, 16] 1 x [4, 10, 10, 12, 13, 15, 16, 19] 1 x [1, 12, 13, 14, 15, 16, 16, 17] 1 x [1, 2, 3, 4, 10, 11, 15, 19] 1 x [1, 1, 2, 8, 10, 11, 15, 17] 1 x [1, 3, 9, 12, 13, 18, 18, 18] 1 x [2, 2, 10, 11, 12, 12, 13, 16] 1 x [1, 3, 9, 9, 10, 12, 13, 14] 1 x [3, 3, 4, 7, 10, 10, 14, 14]