Build (method = -2) #dp: 38591 Step-3' Graph: 980 vertices and 6244 arcs (0.24s) Step-4' Graph: 922 vertices and 6129 arcs (0.24s) #V4/#V3 = 0.94 #A4/#A3 = 0.98 Ready! (0.24s) Optimize a model with 941 rows, 6130 columns and 16557 nonzeros Presolve removed 128 rows and 246 columns Presolve time: 0.09s Presolved: 813 rows, 5884 columns, 16282 nonzeros Variable types: 0 continuous, 5884 integer (546 binary) Found heuristic solution: objective 183.0000000 Optimize a model with 813 rows, 5884 columns and 16282 nonzeros Presolved: 813 rows, 5884 columns, 16282 nonzeros Root barrier log... Ordering time: 0.01s Barrier statistics: AA' NZ : 1.023e+04 Factor NZ : 7.143e+04 (roughly 3 MBytes of memory) Factor Ops : 1.110e+07 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.15170709e+03 -1.25887800e+05 1.56e+05 2.80e-02 1.34e+02 0s 1 7.97599811e+02 -7.59665606e+04 2.03e+04 7.77e-16 2.15e+01 0s 2 4.43341615e+02 -2.90305228e+04 5.58e+03 1.78e-15 6.08e+00 0s 3 3.56050844e+02 -1.03627229e+04 1.18e+03 2.66e-15 1.57e+00 0s 4 3.12330063e+02 -3.29068634e+03 3.91e+02 9.77e-15 4.93e-01 0s 5 2.72536397e+02 -2.31319620e+03 2.19e+02 6.66e-15 3.16e-01 0s 6 2.17179900e+02 -7.48212554e+02 6.91e+01 3.11e-15 1.02e-01 0s 7 1.99530802e+02 -2.96740252e+02 3.51e+01 9.99e-16 4.86e-02 0s 8 1.96507072e+02 -2.94327656e+02 3.19e+01 1.11e-15 4.77e-02 0s 9 1.86339112e+02 -2.51674819e+02 2.89e+01 8.88e-16 4.24e-02 0s 10 1.73108168e+02 -2.10078157e+02 2.44e+01 7.77e-16 3.68e-02 0s 11 1.27116593e+02 -1.48389047e+02 1.21e+01 6.66e-16 2.54e-02 0s 12 9.56612258e+01 -7.96387837e+01 8.29e+00 4.44e-16 1.62e-02 0s 13 6.55648732e+01 -6.94056362e+01 5.31e+00 5.55e-16 1.23e-02 0s 14 4.67267958e+01 -3.80689954e+01 3.53e+00 3.33e-16 7.71e-03 0s 15 4.43115893e+01 -3.49418908e+01 3.29e+00 2.68e-16 7.20e-03 0s 16 3.91759331e+01 -2.31732572e+01 2.72e+00 3.29e-16 5.66e-03 0s 17 3.38101617e+01 -8.35001649e+00 2.09e+00 3.00e-16 3.83e-03 0s 18 2.79668769e+01 2.92509735e+00 1.30e+00 2.49e-16 2.26e-03 0s 19 2.62464247e+01 5.55090484e+00 1.01e+00 2.29e-16 1.85e-03 0s 20 2.53708045e+01 1.04507314e+01 8.74e-01 2.22e-16 1.34e-03 0s 21 2.40679862e+01 1.49220197e+01 5.59e-01 2.68e-16 8.15e-04 0s 22 2.34812266e+01 1.87640054e+01 3.79e-01 2.57e-16 4.20e-04 0s 23 2.25827359e+01 2.08006094e+01 6.99e-02 2.48e-16 1.54e-04 0s 24 2.24212196e+01 2.17390566e+01 3.81e-02 2.48e-16 5.93e-05 0s 25 2.22349134e+01 2.20989876e+01 4.71e-03 3.37e-16 1.17e-05 0s 26 2.22223370e+01 2.22215830e+01 4.23e-11 2.91e-16 6.40e-08 0s 27 2.22222222e+01 2.22222222e+01 6.23e-11 3.38e-16 1.74e-13 0s Barrier solved model in 27 iterations and 0.29 seconds Optimal objective 2.22222222e+01 Root relaxation: objective 2.222222e+01, 3625 iterations, 0.36 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 22.22222 0 72 183.00000 22.22222 87.9% - 1s H 0 0 23.0000000 22.22222 3.38% - 1s Explored 0 nodes (10121 simplex iterations) in 1.52 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.300000000000e+01, best bound 2.300000000000e+01, gap 0.0% Preprocessing time: 0.27 seconds Gurobi run time: 1.52 seconds Total run time: 1.79 seconds Objective: 23 Solution: 3 x [3, 4, 7, 8, 10, 10, 12, 15, 18] 1 x [3, 12, 12, 15, 16, 16, 18, 19] 1 x [2, 3, 4, 5, 6, 6, 17, 17, 17] 1 x [2, 3, 6, 6, 7, 10, 10, 14, 19] 1 x [2, 3, 5, 5, 6, 6, 13, 13, 17] 1 x [3, 6, 6, 17, 19] 1 x [3, 3, 5, 7, 10, 15, 16, 19] 2 x [3, 3, 3, 5, 7, 10, 10, 16, 19] 1 x [4, 6, 6, 7, 10, 10, 12, 15, 16] 1 x [1, 1, 7, 9, 10, 10, 13, 19] 3 x [1, 1, 1, 4, 9, 11, 12, 17, 19] 1 x [1, 1, 1, 7, 9, 10, 10, 13, 19] 5 x [1, 9, 9, 10, 10, 11, 16, 16, 19] 1 x [2, 5, 5, 8, 8, 8, 8, 16, 16]