Build (method = -2) #dp: 662 Step-3' Graph: 143 vertices and 473 arcs (0.00s) Step-4' Graph: 110 vertices and 407 arcs (0.00s) #V4/#V3 = 0.77 #A4/#A3 = 0.86 Ready! (0.00s) Optimize a model with 116 rows, 408 columns and 1017 nonzeros Presolve removed 45 rows and 88 columns Presolve time: 0.00s Presolved: 71 rows, 320 columns, 866 nonzeros Variable types: 0 continuous, 320 integer (0 binary) Found heuristic solution: objective 197.0000000 Found heuristic solution: objective 125.0000000 Optimize a model with 71 rows, 320 columns and 866 nonzeros Presolved: 71 rows, 320 columns, 866 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.630e+02 Factor NZ : 1.455e+03 Factor Ops : 3.395e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.41433970e+02 -9.75246495e+03 5.51e+03 1.11e-16 7.94e+01 0s 1 2.62796332e+02 -4.57449979e+03 7.80e+02 5.55e-16 1.49e+01 0s 2 1.82901777e+02 -9.78448083e+02 7.18e+01 2.55e-15 2.23e+00 0s 3 1.19768672e+02 -2.08655279e+02 4.70e+00 1.89e-15 5.22e-01 0s 4 1.02927696e+02 -7.97711914e+01 3.03e+00 6.66e-16 2.90e-01 0s 5 5.64682671e+01 -2.03350226e+01 1.62e+00 4.44e-16 1.22e-01 0s 6 3.17570681e+01 -5.47368027e+00 7.41e-01 2.28e-16 5.91e-02 0s 7 2.94361343e+01 -1.61102553e+00 6.11e-01 3.01e-16 4.92e-02 0s 8 2.28028022e+01 1.14562189e+01 2.59e-01 3.33e-16 1.80e-02 0s 9 2.10691376e+01 1.67856783e+01 1.36e-01 3.33e-16 6.79e-03 0s 10 2.16572145e+01 1.85944466e+01 3.30e-02 2.33e-16 4.77e-03 0s 11 1.98557182e+01 1.94615075e+01 8.90e-04 2.61e-16 6.11e-04 0s 12 1.98011232e+01 1.97956719e+01 4.03e-07 2.74e-16 8.44e-06 0s 13 1.98000000e+01 1.98000000e+01 2.42e-12 2.29e-16 4.32e-11 0s Barrier solved model in 13 iterations and 0.00 seconds Optimal objective 1.98000000e+01 Root relaxation: objective 1.980000e+01, 153 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 19.80000 0 23 125.00000 19.80000 84.2% - 0s H 0 0 21.0000000 19.80000 5.71% - 0s H 0 0 20.0000000 19.80000 1.00% - 0s Explored 0 nodes (237 simplex iterations) in 0.02 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.000000000000e+01, best bound 2.000000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.02 seconds Total run time: 0.03 seconds Objective: 20 Solution: 4 x [2, 3, 3, 3, 3, 3, 4, 4, 5, 6] 1 x [2, 3, 3, 3, 3, 3, 4, 4, 6] 1 x [1, 1, 3, 3, 3, 4, 6, 6, 6] 7 x [3, 3, 3, 3, 3, 4, 5, 6, 6, 6] 7 x [1, 3, 3, 3, 3, 6, 6, 6, 6, 6]