Build (method = -2) #dp: 3097 Step-3' Graph: 244 vertices and 914 arcs (0.01s) Step-4' Graph: 195 vertices and 816 arcs (0.02s) #V4/#V3 = 0.80 #A4/#A3 = 0.89 Ready! (0.02s) Optimize a model with 204 rows, 817 columns and 2072 nonzeros Presolve removed 50 rows and 95 columns Presolve time: 0.01s Presolved: 154 rows, 722 columns, 1917 nonzeros Variable types: 0 continuous, 722 integer (0 binary) Found heuristic solution: objective 84.0000000 Optimize a model with 154 rows, 722 columns and 1917 nonzeros Presolved: 154 rows, 722 columns, 1917 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.124e+03 Factor NZ : 4.269e+03 Factor Ops : 1.425e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.10700240e+02 -1.54222419e+04 1.04e+04 2.22e-16 5.96e+01 0s 1 2.58033158e+02 -7.46692165e+03 1.81e+03 5.55e-16 1.24e+01 0s 2 1.64117312e+02 -2.20679351e+03 3.71e+02 1.71e-14 2.72e+00 0s 3 1.42592769e+02 -3.98877683e+02 1.74e+01 4.88e-15 4.03e-01 0s 4 9.76810775e+01 -1.06446662e+02 3.01e+00 1.78e-15 1.44e-01 0s 5 6.70347429e+01 -6.06913793e+01 1.91e+00 9.99e-16 8.97e-02 0s 6 3.68360770e+01 -4.78225015e+01 8.99e-01 1.11e-15 5.91e-02 0s 7 2.64609577e+01 -2.12527285e+01 6.11e-01 6.03e-16 3.34e-02 0s 8 1.81035105e+01 -8.10149579e+00 3.14e-01 5.88e-16 1.83e-02 0s 9 1.51290462e+01 3.56868928e+00 1.68e-01 4.75e-16 8.06e-03 0s 10 1.31932340e+01 7.34969036e+00 9.07e-02 6.92e-16 4.07e-03 0s 11 1.20051223e+01 9.63500361e+00 2.44e-02 5.22e-16 1.64e-03 0s 12 1.13395807e+01 1.05766194e+01 6.82e-03 4.96e-16 5.27e-04 0s 13 1.11442801e+01 1.10487601e+01 1.07e-03 4.31e-16 6.61e-05 0s 14 1.11111545e+01 1.11110311e+01 1.57e-06 4.10e-16 8.55e-08 0s 15 1.11111112e+01 1.11111110e+01 2.69e-12 5.92e-16 8.55e-11 0s 16 1.11111111e+01 1.11111111e+01 2.14e-12 4.20e-16 8.55e-14 0s Barrier solved model in 16 iterations and 0.01 seconds Optimal objective 1.11111111e+01 Root relaxation: objective 1.111111e+01, 377 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 11.11111 0 29 84.00000 11.11111 86.8% - 0s H 0 0 17.0000000 11.11111 34.6% - 0s H 0 0 12.0000000 11.11111 7.41% - 0s Explored 0 nodes (973 simplex iterations) in 0.06 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.200000000000e+01, best bound 1.200000000000e+01, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.06 seconds Total run time: 0.09 seconds Objective: 12 Solution: 1 x [1, 2, 4, 4, 7, 7, 7, 7, 8] 1 x [1, 2, 3, 7, 7, 7, 7] 1 x [2, 3, 3, 5, 6] 4 x [1, 3, 3, 4, 5, 5, 6, 9, 9] 2 x [2, 3, 3, 5, 5, 6, 6, 6, 6] 1 x [1, 1, 1, 1, 2, 7, 7] 2 x [1, 1, 1, 1, 1, 1, 7, 7, 7]