Build (method = -2) #dp: 4275 Step-3' Graph: 248 vertices and 1006 arcs (0.02s) Step-4' Graph: 164 vertices and 838 arcs (0.02s) #V4/#V3 = 0.66 #A4/#A3 = 0.83 Ready! (0.02s) Optimize a model with 174 rows, 839 columns and 2200 nonzeros Presolve removed 24 rows and 43 columns Presolve time: 0.01s Presolved: 150 rows, 796 columns, 2156 nonzeros Variable types: 0 continuous, 796 integer (0 binary) Found heuristic solution: objective 672.0000000 Optimize a model with 150 rows, 796 columns and 2156 nonzeros Presolved: 150 rows, 796 columns, 2156 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.179e+03 Factor NZ : 3.511e+03 Factor Ops : 9.443e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.28998378e+03 -1.42829193e+05 1.01e+05 2.22e-16 5.08e+02 0s 1 2.30391642e+03 -6.82514223e+04 1.72e+04 6.66e-16 1.03e+02 0s 2 1.38190517e+03 -2.35463060e+04 4.42e+03 7.99e-15 2.74e+01 0s 3 1.00570296e+03 -4.36746706e+03 3.31e+02 6.66e-16 3.97e+00 0s 4 8.40262092e+02 -1.58936793e+03 1.90e-12 5.07e-16 1.52e+00 0s 5 4.72087708e+02 -5.67076061e+02 8.55e-13 2.67e-16 6.49e-01 0s 6 3.15908352e+02 -3.53212331e+02 5.22e-13 2.91e-16 4.18e-01 0s 7 2.63591217e+02 -8.87021620e+01 4.29e-13 3.38e-16 2.20e-01 0s 8 1.82775050e+02 2.19266589e+00 2.35e-13 2.74e-16 1.13e-01 0s 9 1.55499551e+02 3.24518760e+01 3.80e-13 2.22e-16 7.68e-02 0s 10 1.44977574e+02 9.02188293e+01 4.39e-13 2.25e-16 3.42e-02 0s 11 1.38209387e+02 1.17360393e+02 4.82e-13 2.30e-16 1.30e-02 0s 12 1.25155694e+02 1.23632265e+02 1.70e-12 2.22e-16 9.51e-04 0s 13 1.25000473e+02 1.24997655e+02 5.26e-12 2.38e-16 1.76e-06 0s 14 1.25000000e+02 1.25000000e+02 8.23e-13 2.22e-16 1.77e-12 0s Barrier solved model in 14 iterations and 0.01 seconds Optimal objective 1.25000000e+02 Root relaxation: objective 1.250000e+02, 411 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 125.0000000 125.00000 0.0% - 0s Explored 0 nodes (411 simplex iterations) in 0.03 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.250000000000e+02, best bound 1.250000000000e+02, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.03 seconds Total run time: 0.06 seconds Objective: 125 Solution: 3 x [4, 7, 7, 7, 8, 9, 10, 10] 7 x [1, 4, 7, 7, 7, 9, 9, 10] 10 x [3, 3, 4, 5, 7, 10, 10, 10] 42 x [3, 3, 4, 5, 5, 7, 9, 10] 13 x [1, 1, 1, 3, 6, 6, 8, 9] 5 x [1, 1, 1, 3, 8, 9, 9, 9] 4 x [3, 3, 5, 7, 8, 10, 10, 10] 17 x [2, 2, 5, 5, 6, 7, 8, 8] 24 x [6, 6, 7, 7, 8, 8, 8, 9]