Build (method = -2) #dp: 3851 Step-3' Graph: 475 vertices and 1828 arcs (0.02s) Step-4' Graph: 461 vertices and 1799 arcs (0.02s) #V4/#V3 = 0.97 #A4/#A3 = 0.98 Ready! (0.02s) Optimize a model with 469 rows, 1800 columns and 4504 nonzeros Presolve removed 162 rows and 373 columns Presolve time: 0.03s Presolved: 307 rows, 1427 columns, 3787 nonzeros Variable types: 0 continuous, 1427 integer (150 binary) Found heuristic solution: objective 76.0000000 Optimize a model with 307 rows, 1427 columns and 3787 nonzeros Presolved: 307 rows, 1427 columns, 3787 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.220e+03 Factor NZ : 1.003e+04 Factor Ops : 4.506e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 8.06356346e+02 -3.24727620e+04 2.76e+04 5.74e-02 9.44e+01 0s 1 2.22860672e+02 -2.04367236e+04 3.64e+03 3.44e-15 1.68e+01 0s 2 1.52485543e+02 -5.11358705e+03 9.12e+02 3.55e-15 3.50e+00 0s 3 1.56362596e+02 -1.37578086e+03 2.57e+02 6.66e-15 9.35e-01 0s 4 1.15411761e+02 -3.43490383e+02 2.51e+01 9.77e-15 1.87e-01 0s 5 1.03170550e+02 -2.18661151e+02 5.73e+00 8.44e-15 1.17e-01 0s 6 8.21839784e+01 -2.08580131e+02 3.20e+00 9.10e-15 1.04e-01 0s 7 7.58956029e+01 -1.23823769e+02 2.66e+00 4.44e-15 7.15e-02 0s 8 6.76833723e+01 -7.97656713e+01 1.82e+00 4.24e-15 5.25e-02 0s 9 5.82188627e+01 -6.04088460e+01 1.34e+00 3.81e-15 4.21e-02 0s 10 3.45772639e+01 -1.96099421e+01 7.74e-01 2.26e-15 1.93e-02 0s 11 2.01640124e+01 -8.75120237e+00 3.80e-01 2.70e-15 1.02e-02 0s 12 1.32846353e+01 -2.06546870e+00 1.60e-01 2.72e-15 5.41e-03 0s 13 1.12556046e+01 1.82178431e+00 1.05e-01 2.66e-15 3.33e-03 0s 14 9.38861476e+00 4.84262481e+00 5.31e-02 2.48e-15 1.60e-03 0s 15 9.13950107e+00 6.81371036e+00 3.36e-02 1.85e-15 8.19e-04 0s 16 8.75663642e+00 7.34632318e+00 1.79e-02 2.70e-15 4.96e-04 0s 17 8.56446121e+00 7.72317804e+00 1.13e-02 2.49e-15 2.96e-04 0s 18 8.40163130e+00 7.97954619e+00 5.40e-03 2.39e-15 1.48e-04 0s 19 8.33221156e+00 8.08309541e+00 3.15e-03 2.42e-15 8.75e-05 0s 20 8.27967583e+00 8.14981685e+00 1.55e-03 2.56e-15 4.56e-05 0s 21 8.26024483e+00 8.18528121e+00 1.01e-03 2.73e-15 2.63e-05 0s 22 8.24721040e+00 8.20004660e+00 6.45e-04 2.67e-15 1.66e-05 0s 23 8.22340707e+00 8.21605401e+00 1.30e-05 1.96e-15 2.57e-06 0s 24 8.22208402e+00 8.22156826e+00 2.73e-07 2.12e-15 1.80e-07 0s 25 8.22200030e+00 8.22199965e+00 8.19e-10 1.74e-15 2.27e-10 0s 26 8.22200000e+00 8.22200000e+00 4.87e-13 1.78e-15 2.95e-16 0s Barrier solved model in 26 iterations and 0.04 seconds Optimal objective 8.22200000e+00 Root relaxation: objective 8.222000e+00, 357 iterations, 0.04 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 8.22200 0 39 76.00000 8.22200 89.2% - 0s H 0 0 9.0000000 8.22200 8.64% - 0s Explored 0 nodes (606 simplex iterations) in 0.11 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 9.000000000000e+00, best bound 9.000000000000e+00, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.11 seconds Total run time: 0.14 seconds Objective: 9 Solution: 3 x [1, 2, 4, 4, 4, 4, 6, 6, 6] 1 x [2, 2, 2, 4, 6, 6, 6, 7, 7, 7, 7, 7] 1 x [2, 2, 3, 3, 4, 4, 4, 6, 6, 6, 7] 1 x [2, 3, 3, 3, 3, 6, 6, 7, 8] 1 x [2, 2, 2, 2, 3, 3, 5, 5, 5, 5, 6, 6, 6, 7, 7] 1 x [2, 2, 2, 2, 3, 3, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 7, 7] 1 x [3, 3, 3, 7, 7, 7, 7, 7]