Build (method = -2) #dp: 35890 Step-3' Graph: 1005 vertices and 6757 arcs (0.22s) Step-4' Graph: 921 vertices and 6591 arcs (0.23s) #V4/#V3 = 0.92 #A4/#A3 = 0.98 Ready! (0.23s) Optimize a model with 939 rows, 6592 columns and 17944 nonzeros Presolve removed 91 rows and 166 columns Presolve time: 0.07s Presolved: 848 rows, 6426 columns, 17886 nonzeros Variable types: 0 continuous, 6426 integer (0 binary) Found heuristic solution: objective 200.0000000 Optimize a model with 848 rows, 6426 columns and 17886 nonzeros Presolved: 848 rows, 6426 columns, 17886 nonzeros Root barrier log... Ordering time: 0.01s Barrier statistics: AA' NZ : 1.075e+04 Factor NZ : 6.057e+04 (roughly 3 MBytes of memory) Factor Ops : 7.007e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.33293452e+03 -1.83370392e+05 1.86e+05 2.22e-16 1.61e+02 0s 1 7.97298982e+02 -1.04005304e+05 2.56e+04 8.88e-16 2.68e+01 0s 2 4.60747913e+02 -4.83542611e+04 9.07e+03 6.66e-15 9.65e+00 0s 3 2.54845496e+02 -2.09744087e+04 1.85e+03 5.77e-14 2.73e+00 0s 4 2.09193427e+02 -7.94409062e+03 3.24e+02 1.47e-14 7.98e-01 0s 5 2.01679827e+02 -3.77347917e+03 7.24e+01 4.00e-15 3.39e-01 0s 6 1.99341233e+02 -1.33388504e+03 4.58e+00 2.44e-15 1.20e-01 0s 7 1.89404879e+02 -7.23866976e+02 4.21e-03 1.55e-15 7.10e-02 0s 8 1.30703521e+02 -5.74995160e+02 2.17e-03 6.20e-15 5.48e-02 0s 9 1.03464167e+02 -2.86828535e+02 1.45e-03 3.41e-15 3.03e-02 0s 10 7.72370038e+01 -1.64279591e+02 1.02e-03 3.02e-15 1.88e-02 0s 11 6.18504137e+01 -1.18034436e+02 7.91e-04 2.59e-15 1.40e-02 0s 12 4.22245937e+01 -4.77907204e+01 4.76e-04 2.27e-15 6.99e-03 0s 13 3.32884450e+01 -1.96956218e+01 2.98e-04 2.55e-15 4.12e-03 0s 14 3.00460004e+01 -2.70821869e+00 2.16e-04 2.14e-15 2.55e-03 0s 15 2.68361642e+01 4.51958835e+00 1.44e-04 1.65e-15 1.73e-03 0s 16 2.51166959e+01 1.01959086e+01 8.34e-05 1.66e-15 1.16e-03 0s 17 2.41344825e+01 1.81300549e+01 4.09e-05 1.19e-15 4.67e-04 0s 18 2.34916946e+01 2.01665774e+01 1.75e-05 1.25e-15 2.58e-04 0s 19 2.31619569e+01 2.17291100e+01 6.94e-06 1.46e-15 1.11e-04 0s 20 2.30735375e+01 2.20133095e+01 5.07e-06 1.59e-15 8.24e-05 0s 21 2.29763979e+01 2.23026991e+01 2.98e-06 1.56e-15 5.23e-05 0s 22 2.29348272e+01 2.25140942e+01 2.12e-06 1.41e-15 3.27e-05 0s 23 2.28878994e+01 2.26584633e+01 1.14e-06 1.33e-15 1.78e-05 0s 24 2.28381387e+01 2.27599349e+01 1.85e-07 1.28e-15 6.08e-06 0s 25 2.28292391e+01 2.27966598e+01 6.12e-08 1.11e-15 2.53e-06 0s 26 2.28250675e+01 2.28196712e+01 1.09e-08 1.22e-15 4.19e-07 0s 27 2.28240045e+01 2.28239833e+01 1.96e-11 1.13e-15 1.65e-09 0s 28 2.28240000e+01 2.28240000e+01 3.15e-12 1.07e-15 1.83e-15 0s Barrier solved model in 28 iterations and 0.29 seconds Optimal objective 2.28240000e+01 Root relaxation: objective 2.282400e+01, 2589 iterations, 0.34 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 22.82400 0 86 200.00000 22.82400 88.6% - 1s H 0 0 24.0000000 22.82400 4.90% - 1s H 0 0 23.0000000 22.82400 0.77% - 1s Explored 0 nodes (6151 simplex iterations) in 1.38 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.26 seconds Gurobi run time: 1.38 seconds Total run time: 1.64 seconds Objective: 23 Solution: 1 x [1, 2, 5, 6, 8, 9, 9, 13] 1 x [1, 2, 4, 5, 6, 7, 9, 9, 13] 1 x [2, 5, 8, 10, 10, 11, 13, 13, 17] 1 x [2, 2, 4, 5, 9, 11, 11, 17, 17] 1 x [3, 5, 5, 6, 10, 11, 16, 17, 17] 1 x [4, 4, 4, 4, 5, 5, 9, 13, 17] 1 x [2, 5, 5, 8, 10, 10, 11, 13] 2 x [3, 5, 5, 5, 8, 8, 10, 17, 17] 1 x [2, 3, 7, 9, 12, 13, 14, 16] 2 x [2, 2, 7, 7, 9, 10, 12, 13, 16] 1 x [3, 3, 3, 6, 6, 11, 12, 14, 15] 1 x [3, 6, 8, 11, 11, 11, 12, 15, 17] 2 x [2, 2, 9, 9, 14, 15, 15, 15, 16] 1 x [2, 4, 4, 8, 9, 9, 16, 16, 17] 1 x [4, 7, 9, 9, 9, 15, 16, 16, 17] 2 x [3, 7, 16, 16, 16, 16, 18] 1 x [8, 8, 8, 8, 9, 11, 11, 11, 17] 2 x [9, 11, 11, 11, 15, 15, 15, 15, 15]