Build (method = -2) #dp: 4362 Step-3' Graph: 481 vertices and 2263 arcs (0.02s) Step-4' Graph: 454 vertices and 2209 arcs (0.02s) #V4/#V3 = 0.94 #A4/#A3 = 0.98 Ready! (0.02s) Optimize a model with 464 rows, 2210 columns and 5739 nonzeros Presolve removed 50 rows and 94 columns Presolve time: 0.02s Presolved: 414 rows, 2116 columns, 5612 nonzeros Variable types: 0 continuous, 2116 integer (0 binary) Found heuristic solution: objective 843.0000000 Optimize a model with 414 rows, 2116 columns and 5612 nonzeros Presolved: 414 rows, 2116 columns, 5612 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.318e+03 Factor NZ : 1.992e+04 (roughly 1 MByte of memory) Factor Ops : 1.656e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.50969915e+03 -4.57956323e+05 2.83e+05 2.22e-16 6.90e+02 0s 1 2.20741123e+03 -2.98208209e+05 4.35e+04 1.22e-15 1.52e+02 0s 2 1.61775513e+03 -1.00798237e+05 1.53e+04 1.55e-15 4.83e+01 0s 3 1.12551781e+03 -3.02079111e+04 3.12e+03 3.06e-14 1.16e+01 0s 4 9.97838085e+02 -9.61224368e+03 3.77e+01 7.11e-15 2.54e+00 0s 5 9.91832512e+02 -2.68712378e+03 8.39e-02 2.22e-15 8.68e-01 0s 6 8.25757051e+02 -2.74703013e+03 4.81e-02 2.00e-15 8.43e-01 0s 7 8.06753977e+02 -1.57656245e+03 4.13e-02 1.55e-15 5.62e-01 0s 8 6.38628896e+02 -1.15472404e+03 3.10e-02 1.22e-15 4.23e-01 0s 9 4.77789059e+02 -4.52496170e+02 2.09e-02 8.01e-16 2.19e-01 0s 10 3.03860053e+02 -2.31390959e+02 1.21e-02 9.03e-16 1.26e-01 0s 11 1.88722526e+02 -6.86085282e+01 5.35e-03 6.66e-16 6.07e-02 0s 12 1.77717579e+02 -3.77457910e+01 4.42e-03 8.22e-16 5.08e-02 0s 13 1.48709217e+02 4.18746618e+01 1.88e-03 7.40e-16 2.52e-02 0s 14 1.32086916e+02 9.28676061e+01 7.36e-04 5.76e-16 9.25e-03 0s 15 1.24133226e+02 1.08732921e+02 2.72e-04 5.98e-16 3.63e-03 0s 16 1.21496366e+02 1.14461477e+02 9.97e-05 6.66e-16 1.66e-03 0s 17 1.20179505e+02 1.17060567e+02 4.18e-05 6.76e-16 7.35e-04 0s 18 1.19372624e+02 1.17972202e+02 1.05e-05 5.49e-16 3.30e-04 0s 19 1.19219935e+02 1.18402676e+02 6.58e-06 6.87e-16 1.93e-04 0s 20 1.19028154e+02 1.18597877e+02 1.95e-06 5.77e-16 1.01e-04 0s 21 1.18980134e+02 1.18780358e+02 8.49e-07 7.77e-16 4.71e-05 0s 22 1.18957713e+02 1.18891917e+02 3.42e-07 4.79e-16 1.55e-05 0s 23 1.18939963e+02 1.18924376e+02 6.96e-08 5.56e-16 3.67e-06 0s 24 1.18935048e+02 1.18934879e+02 5.01e-10 4.76e-16 4.00e-08 0s 25 1.18935000e+02 1.18935000e+02 1.07e-11 6.27e-16 6.45e-14 0s Barrier solved model in 25 iterations and 0.07 seconds Optimal objective 1.18935000e+02 Root relaxation: objective 1.189350e+02, 576 iterations, 0.08 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 118.93500 0 42 843.00000 118.93500 85.9% - 0s H 0 0 120.0000000 118.93500 0.89% - 0s 0 0 119.00000 0 56 120.00000 119.00000 0.83% - 0s H 0 0 119.0000000 119.00000 0.0% - 0s Cutting planes: Gomory: 1 Explored 0 nodes (1548 simplex iterations) in 0.38 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.190000000000e+02, best bound 1.190000000000e+02, gap 0.0% Preprocessing time: 0.04 seconds Gurobi run time: 0.38 seconds Total run time: 0.42 seconds Objective: 119 Solution: 2 x [2, 2, 3, 3, 4, 6, 8, 9, 10] 45 x [2, 4, 5, 6, 8, 8, 9, 10, 10] 12 x [1, 1, 4, 4, 7, 8, 9] 6 x [1, 1, 4, 4, 5, 8, 9] 5 x [2, 4, 4, 4, 5, 5, 9, 10] 1 x [1, 3, 3, 3, 6, 6, 6, 9, 10] 7 x [3, 3, 3, 6, 8, 9, 10, 10, 10] 22 x [3, 3, 3, 8, 9, 9, 10, 10] 1 x [1, 4, 8, 10, 10, 10, 10, 10, 10] 1 x [3, 3, 3, 3, 4, 6, 7, 8, 10] 5 x [4, 4, 6, 7, 8, 10, 10, 10, 10] 10 x [1, 1, 1, 1, 1, 1, 2, 2] 1 x [2, 2, 3, 3, 3, 3, 6, 8, 10, 10] 1 x [2, 2, 3, 3, 3, 3, 3, 6, 8, 10]