Build (method = -2) #dp: 3816 Step-3' Graph: 385 vertices and 1416 arcs (0.02s) Step-4' Graph: 307 vertices and 1260 arcs (0.02s) #V4/#V3 = 0.80 #A4/#A3 = 0.89 Ready! (0.02s) Optimize a model with 317 rows, 1261 columns and 3181 nonzeros Presolve removed 99 rows and 187 columns Presolve time: 0.02s Presolved: 218 rows, 1074 columns, 2921 nonzeros Variable types: 0 continuous, 1074 integer (137 binary) Found heuristic solution: objective 79.0000000 Optimize a model with 218 rows, 1074 columns and 2921 nonzeros Presolve removed 2 rows and 2 columns Presolved: 216 rows, 1072 columns, 2928 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.674e+03 Factor NZ : 6.343e+03 Factor Ops : 2.348e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.28427201e+03 -2.36755056e+04 2.52e+04 7.54e-02 9.24e+01 0s 1 4.22577671e+02 -1.33497457e+04 4.26e+03 5.55e-16 1.83e+01 0s 2 2.32396104e+02 -4.00475203e+03 8.90e+02 1.22e-15 3.90e+00 0s 3 1.67079785e+02 -9.02955453e+02 7.78e+01 9.16e-16 6.25e-01 0s 4 1.50023450e+02 -3.85257323e+02 3.00e+01 5.83e-16 2.81e-01 0s 5 1.09204353e+02 -2.63439826e+02 1.64e+01 6.11e-16 1.89e-01 0s 6 7.97425878e+01 -1.51449243e+02 8.87e+00 5.85e-16 1.15e-01 0s 7 7.53855259e+01 -1.26156212e+02 8.14e+00 6.90e-16 1.00e-01 0s 8 5.43070281e+01 -7.50355472e+01 4.97e+00 7.15e-16 6.39e-02 0s 9 2.50217909e+01 -2.42113440e+01 1.70e+00 5.34e-16 2.40e-02 0s 10 2.45950785e+01 -1.28995728e+01 1.28e+00 5.19e-16 1.82e-02 0s 11 1.69055727e+01 1.42520480e+00 7.70e-01 4.86e-16 7.57e-03 0s 12 1.41898978e+01 4.58922796e+00 4.74e-01 4.84e-16 4.65e-03 0s 13 1.28140130e+01 6.92896044e+00 3.21e-01 4.23e-16 2.84e-03 0s 14 1.23145188e+01 9.03024708e+00 1.70e-01 5.10e-16 1.56e-03 0s 15 1.12728508e+01 9.59846666e+00 7.60e-02 4.61e-16 7.92e-04 0s 16 1.07136445e+01 1.00232610e+01 2.37e-02 3.47e-16 3.25e-04 0s 17 1.04507122e+01 1.03082858e+01 1.27e-03 3.00e-16 6.64e-05 0s 18 1.04153489e+01 1.03561333e+01 2.84e-04 3.67e-16 2.76e-05 0s 19 1.04056662e+01 1.03761137e+01 1.03e-04 4.07e-16 1.37e-05 0s 20 1.04004149e+01 1.03881314e+01 2.55e-05 4.44e-16 5.71e-06 0s 21 1.03988876e+01 1.03954044e+01 8.54e-06 3.73e-16 1.62e-06 0s 22 1.03980588e+01 1.03978777e+01 4.19e-07 3.33e-16 8.42e-08 0s 23 1.03980001e+01 1.03979999e+01 1.93e-13 3.33e-16 8.43e-11 0s 24 1.03980000e+01 1.03980000e+01 9.01e-14 3.68e-16 8.43e-14 0s Barrier solved model in 24 iterations and 0.02 seconds Optimal objective 1.03980000e+01 Root relaxation: objective 1.039800e+01, 183 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 10.39800 0 42 79.00000 10.39800 86.8% - 0s H 0 0 12.0000000 10.39800 13.4% - 0s H 0 0 11.0000000 10.39800 5.47% - 0s Explored 0 nodes (307 simplex iterations) in 0.09 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.100000000000e+01, best bound 1.100000000000e+01, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.09 seconds Total run time: 0.12 seconds Objective: 11 Solution: 1 x [4, 5, 6, 8, 10, 10, 10] 1 x [3, 4, 8, 9, 10, 10, 10] 1 x [1, 3, 3, 3, 3, 4, 4, 8] 2 x [4, 5, 5, 6, 6, 6, 7, 7, 7, 10] 1 x [2, 5, 6, 6, 7, 7, 7, 10] 2 x [5, 9, 9, 9, 10, 10, 10, 10, 10, 10] 3 x [3, 3, 3, 3, 3, 3, 5, 5, 5, 10]