Build (method = -2) #dp: 5209 Step-3' Graph: 320 vertices and 1144 arcs (0.03s) Step-4' Graph: 214 vertices and 932 arcs (0.03s) #V4/#V3 = 0.67 #A4/#A3 = 0.81 Ready! (0.03s) Optimize a model with 224 rows, 933 columns and 2383 nonzeros Presolve removed 49 rows and 95 columns Presolve time: 0.01s Presolved: 175 rows, 838 columns, 2260 nonzeros Variable types: 0 continuous, 838 integer (124 binary) Found heuristic solution: objective 729.0000000 Optimize a model with 175 rows, 838 columns and 2260 nonzeros Presolved: 175 rows, 838 columns, 2260 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.224e+03 Factor NZ : 3.868e+03 Factor Ops : 9.702e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 9.55334166e+03 -1.16407117e+05 1.63e+05 7.90e-02 6.42e+02 0s 1 2.49681990e+03 -6.47091907e+04 2.38e+04 5.55e-16 1.13e+02 0s 2 1.41221992e+03 -2.21685042e+04 5.85e+03 8.88e-16 2.87e+01 0s 3 1.04422555e+03 -3.71088843e+03 4.22e+02 2.44e-15 3.61e+00 0s 4 9.14330861e+02 -1.67737590e+03 9.59e+01 1.67e-15 1.67e+00 0s 5 6.56346549e+02 -7.73139570e+02 5.31e+01 8.88e-16 9.10e-01 0s 6 4.47371983e+02 -4.34031441e+02 3.48e+01 4.44e-16 5.61e-01 0s 7 3.56745126e+02 -2.28665349e+02 2.62e+01 3.33e-16 3.74e-01 0s 8 2.83678668e+02 -1.22293275e+02 1.98e+01 4.02e-16 2.60e-01 0s 9 1.94002349e+02 -6.71072656e+01 1.14e+01 3.75e-16 1.66e-01 0s 10 1.49533251e+02 1.65990384e+01 7.19e+00 2.84e-16 8.48e-02 0s 11 1.26566257e+02 6.62766621e+01 3.56e+00 4.11e-16 3.81e-02 0s 12 1.17907119e+02 1.01104959e+02 1.76e+00 3.30e-16 1.07e-02 0s 13 1.11705528e+02 1.10223595e+02 2.90e-02 3.15e-16 8.88e-04 0s 14 1.11114001e+02 1.11060452e+02 2.13e-05 2.58e-16 3.18e-05 0s 15 1.11111133e+02 1.11110994e+02 3.57e-12 2.22e-16 8.24e-08 0s 16 1.11111111e+02 1.11111111e+02 2.13e-13 2.34e-16 8.36e-14 0s Barrier solved model in 16 iterations and 0.01 seconds Optimal objective 1.11111111e+02 Root relaxation: objective 1.111111e+02, 472 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 111.11111 0 20 729.00000 111.11111 84.8% - 0s H 0 0 112.0000000 111.11111 0.79% - 0s Explored 0 nodes (1054 simplex iterations) in 0.06 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.120000000000e+02, best bound 1.120000000000e+02, gap 0.0% Preprocessing time: 0.04 seconds Gurobi run time: 0.06 seconds Total run time: 0.10 seconds Objective: 112 Solution: 28 x [1, 4, 4, 4, 5, 6, 6, 10, 10] 14 x [1, 4, 5, 6, 6, 6, 6, 6, 6] 6 x [1, 1, 2, 2, 2, 4, 4, 5, 9] 3 x [1, 1, 1, 2, 2, 2, 4, 5, 9] 1 x [1, 1, 1, 2, 2, 2, 4, 5] 1 x [1, 2, 2, 3, 5, 5, 6] 44 x [5, 5, 6, 7, 9, 9, 9, 10, 10] 1 x [1, 2, 5, 5, 6, 7, 8] 13 x [1, 1, 2, 2, 4, 4, 4, 5, 5] 1 x [1, 1, 2, 2, 2, 4]