Build (method = -2) #dp: 4279 Step-3' Graph: 493 vertices and 2333 arcs (0.02s) Step-4' Graph: 463 vertices and 2273 arcs (0.03s) #V4/#V3 = 0.94 #A4/#A3 = 0.97 Ready! (0.03s) Optimize a model with 473 rows, 2274 columns and 5906 nonzeros Presolve removed 57 rows and 105 columns Presolve time: 0.04s Presolved: 416 rows, 2169 columns, 5799 nonzeros Variable types: 0 continuous, 2169 integer (162 binary) Found heuristic solution: objective 65.0000000 Optimize a model with 416 rows, 2169 columns and 5799 nonzeros Presolved: 416 rows, 2169 columns, 5799 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.367e+03 Factor NZ : 1.824e+04 (roughly 1 MByte of memory) Factor Ops : 1.320e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.73991011e+03 -5.49219184e+04 6.14e+04 8.43e-02 1.48e+02 0s 1 5.28990056e+02 -3.73404054e+04 9.15e+03 9.99e-16 2.73e+01 0s 2 2.36784321e+02 -1.39102547e+04 1.66e+03 1.44e-15 5.95e+00 0s 3 1.93838376e+02 -3.74402226e+03 3.93e+02 3.11e-15 1.42e+00 0s 4 1.39945061e+02 -1.03201136e+03 1.87e+02 2.66e-15 4.76e-01 0s 5 1.07714063e+02 -5.78386411e+02 7.91e+01 3.11e-15 2.30e-01 0s 6 9.43940507e+01 -1.61802789e+02 3.36e+01 1.22e-15 7.57e-02 0s 7 8.20013879e+01 -1.01191057e+02 3.54e+00 1.49e-15 4.36e-02 0s 8 6.34858653e+01 -6.20984939e+01 2.45e+00 1.30e-15 2.98e-02 0s 9 5.31287497e+01 -4.36277216e+01 1.99e+00 1.32e-15 2.30e-02 0s 10 3.61384783e+01 -2.17110623e+01 1.06e+00 1.08e-15 1.37e-02 0s 11 2.10401694e+01 -1.11889553e+01 5.78e-01 1.28e-15 7.59e-03 0s 12 1.81438516e+01 -8.48121983e+00 4.64e-01 1.50e-15 6.26e-03 0s 13 1.75191799e+01 -7.32950633e+00 4.37e-01 1.87e-15 5.84e-03 0s 14 1.53802716e+01 -1.99077781e+00 3.33e-01 1.55e-15 4.08e-03 0s 15 1.31657398e+01 5.89354158e-01 2.03e-01 1.77e-15 2.94e-03 0s 16 1.39088179e+01 4.79600574e+00 1.37e-01 1.34e-15 2.12e-03 0s 17 1.36735206e+01 5.90670530e+00 1.29e-01 1.49e-15 1.81e-03 0s 18 1.26386025e+01 7.45145876e+00 9.16e-02 1.34e-15 1.21e-03 0s 19 1.21058654e+01 8.50222721e+00 6.41e-02 1.45e-15 8.37e-04 0s 20 1.15041720e+01 9.20800745e+00 4.13e-02 1.43e-15 5.33e-04 0s 21 1.11395171e+01 9.85911354e+00 2.43e-02 1.22e-15 2.97e-04 0s 22 1.07297170e+01 1.02841619e+01 6.27e-03 1.10e-15 1.03e-04 0s 23 1.06244065e+01 1.03893259e+01 2.39e-03 1.15e-15 5.43e-05 0s 24 1.05773427e+01 1.04871424e+01 9.06e-04 1.08e-15 2.08e-05 0s 25 1.05639610e+01 1.05152782e+01 5.59e-04 1.14e-15 1.13e-05 0s 26 1.05528157e+01 1.05294557e+01 2.89e-04 1.17e-15 5.40e-06 0s 27 1.05433927e+01 1.05336525e+01 7.21e-05 1.22e-15 2.25e-06 0s 28 1.05400764e+01 1.05397106e+01 3.67e-07 1.12e-15 8.42e-08 0s 29 1.05400001e+01 1.05399997e+01 7.11e-14 8.47e-16 8.55e-11 0s 30 1.05400000e+01 1.05400000e+01 2.42e-14 9.61e-16 8.73e-17 0s Barrier solved model in 30 iterations and 0.08 seconds Optimal objective 1.05400000e+01 Root relaxation: objective 1.054000e+01, 565 iterations, 0.09 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 10.54000 0 33 65.00000 10.54000 83.8% - 0s H 0 0 12.0000000 10.54000 12.2% - 0s H 0 0 11.0000000 10.54000 4.18% - 0s Explored 0 nodes (1652 simplex iterations) in 0.30 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.100000000000e+01, best bound 1.100000000000e+01, gap 0.0% Preprocessing time: 0.05 seconds Gurobi run time: 0.30 seconds Total run time: 0.34 seconds Objective: 11 Solution: 1 x [2, 2, 4, 4, 4, 6, 6, 6] 2 x [2, 2, 4, 4, 4, 4, 9, 9, 9, 9] 2 x [2, 2, 2, 2, 7, 9, 9, 9, 9] 1 x [1, 5, 7, 10, 10, 10, 10, 10] 1 x [5, 5, 7, 7, 9, 10] 2 x [1, 1, 6, 6, 6, 6, 6, 7, 10] 1 x [3, 6, 6, 6, 6, 6, 7, 9, 9] 1 x [4, 6, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 9]