Build (method = -2) #dp: 50753 Step-3' Graph: 910 vertices and 5937 arcs (0.32s) Step-4' Graph: 830 vertices and 5778 arcs (0.33s) #V4/#V3 = 0.91 #A4/#A3 = 0.97 Ready! (0.33s) Optimize a model with 850 rows, 5779 columns and 15683 nonzeros Presolve removed 91 rows and 182 columns Presolve time: 0.07s Presolved: 759 rows, 5597 columns, 15504 nonzeros Variable types: 0 continuous, 5597 integer (0 binary) Found heuristic solution: objective 200.0000000 Optimize a model with 759 rows, 5597 columns and 15504 nonzeros Presolved: 759 rows, 5597 columns, 15504 nonzeros Root barrier log... Ordering time: 0.01s Barrier statistics: AA' NZ : 9.853e+03 Factor NZ : 5.373e+04 (roughly 3 MBytes of memory) Factor Ops : 5.944e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.12555494e+03 -2.43777302e+05 2.53e+05 2.22e-16 3.15e+02 0s 1 1.28879799e+03 -1.25807278e+05 3.55e+04 2.22e-15 4.98e+01 0s 2 5.77971309e+02 -5.81660789e+04 1.00e+04 1.44e-15 1.49e+01 0s 3 3.06599000e+02 -2.05487473e+04 2.21e+03 3.11e-15 3.59e+00 0s 4 2.83605766e+02 -8.39637340e+03 6.00e+02 5.33e-15 1.19e+00 0s 5 2.13629418e+02 -3.40654089e+03 6.61e+01 4.00e-15 3.60e-01 0s 6 1.94160952e+02 -2.05197429e+03 2.45e+01 2.89e-15 2.10e-01 0s 7 1.93991126e+02 -6.38132315e+02 1.87e+01 1.57e-15 7.78e-02 0s 8 1.44458032e+02 -3.90886406e+02 4.12e-02 1.55e-15 4.77e-02 0s 9 1.03793791e+02 -2.51414813e+02 2.39e-02 7.86e-15 3.17e-02 0s 10 7.86053818e+01 -1.80296572e+02 1.60e-02 6.04e-15 2.31e-02 0s 11 5.69312413e+01 -1.46189798e+02 1.09e-02 5.20e-15 1.81e-02 0s 12 4.47596686e+01 -5.71705859e+01 7.92e-03 2.44e-15 9.09e-03 0s 13 3.38129630e+01 -8.56791162e+00 4.78e-03 1.35e-15 3.78e-03 0s 14 3.04722824e+01 1.03184811e+00 3.41e-03 1.28e-15 2.63e-03 0s 15 2.80874636e+01 6.71175762e+00 2.25e-03 1.50e-15 1.91e-03 0s 16 2.77816074e+01 1.02129446e+01 2.08e-03 1.68e-15 1.57e-03 0s 17 2.56863709e+01 1.43424550e+01 1.36e-03 1.51e-15 1.01e-03 0s 18 2.48604739e+01 1.77598150e+01 9.45e-04 1.50e-15 6.33e-04 0s 19 2.23756638e+01 2.10957199e+01 2.47e-13 1.29e-15 1.14e-04 0s 20 2.22235723e+01 2.22207865e+01 4.50e-13 9.07e-16 2.48e-07 0s 21 2.22222222e+01 2.22222222e+01 2.96e-13 1.24e-15 4.83e-13 0s Barrier solved model in 21 iterations and 0.17 seconds Optimal objective 2.22222222e+01 Root relaxation: objective 2.222222e+01, 4093 iterations, 0.23 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 22.22222 0 63 200.00000 22.22222 88.9% - 1s H 0 0 24.0000000 22.22222 7.41% - 1s H 0 0 23.0000000 22.22222 3.38% - 1s Explored 0 nodes (10132 simplex iterations) in 1.41 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.35 seconds Gurobi run time: 1.41 seconds Total run time: 1.76 seconds Objective: 23 Solution: 2 x [1, 5, 10, 11, 12, 14, 18, 18, 20] 3 x [2, 11, 13, 14, 16, 17, 17, 19, 20] 1 x [3, 3, 4, 7, 7, 11, 18, 19, 19] 1 x [3, 3, 3, 4, 4, 4, 5, 6] 3 x [3, 3, 4, 4, 4, 10, 13, 17, 19] 1 x [7, 11, 12, 14, 15, 16, 20, 20, 20] 1 x [6, 11, 14, 14, 15, 15, 18] 1 x [3, 5, 5, 11, 12, 13, 14, 16, 20] 1 x [5, 5, 6, 11, 12, 14, 19] 3 x [7, 11, 12, 14, 17, 18, 18, 19, 20] 1 x [6, 9, 9, 9, 9, 9, 9, 15] 1 x [5, 5, 8, 12, 12, 13, 16, 20] 4 x [5, 5, 8, 8, 12, 12, 13, 16, 20]