Build (method = -2) #dp: 7270 Step-3' Graph: 592 vertices and 2869 arcs (0.04s) Step-4' Graph: 586 vertices and 2857 arcs (0.04s) #V4/#V3 = 0.99 #A4/#A3 = 1.00 Ready! (0.04s) Optimize a model with 596 rows, 2858 columns and 7443 nonzeros Presolve removed 75 rows and 143 columns Presolve time: 0.04s Presolved: 521 rows, 2715 columns, 7218 nonzeros Variable types: 0 continuous, 2715 integer (0 binary) Found heuristic solution: objective 1000.0000000 Optimize a model with 521 rows, 2715 columns and 7218 nonzeros Presolved: 521 rows, 2715 columns, 7218 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.389e+03 Factor NZ : 2.830e+04 (roughly 2 MBytes of memory) Factor Ops : 2.625e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.53301607e+03 -4.20898413e+05 3.12e+05 2.22e-16 6.17e+02 0s 1 1.76161512e+03 -3.05788732e+05 4.23e+04 2.22e-15 1.24e+02 0s 2 1.30647662e+03 -9.61293459e+04 1.31e+04 1.55e-15 3.42e+01 0s 3 1.06141113e+03 -2.62688179e+04 2.36e+03 1.02e-14 7.48e+00 0s 4 1.00282758e+03 -7.21170603e+03 3.67e+02 6.22e-15 1.76e+00 0s 5 9.82669825e+02 -3.29586590e+03 2.79e+01 2.89e-15 7.99e-01 0s 6 8.64142008e+02 -2.17425880e+03 5.30e-02 2.22e-15 5.59e-01 0s 7 6.79419215e+02 -1.06232242e+03 2.84e-02 1.36e-15 3.20e-01 0s 8 4.60175181e+02 -4.75379611e+02 1.74e-02 1.17e-15 1.72e-01 0s 9 2.89588102e+02 -1.94135611e+02 8.40e-03 1.18e-15 8.89e-02 0s 10 2.23268200e+02 -8.89490759e+01 5.21e-03 1.46e-15 5.74e-02 0s 11 1.89757025e+02 4.87418998e+00 3.60e-03 1.34e-15 3.40e-02 0s 12 1.46784106e+02 2.98773273e+01 1.63e-03 1.38e-15 2.15e-02 0s 13 1.37409893e+02 6.19581636e+01 1.19e-03 1.21e-15 1.39e-02 0s 14 1.37601940e+02 8.47994610e+01 1.01e-03 1.28e-15 9.71e-03 0s 15 1.27397194e+02 1.00909835e+02 4.93e-04 1.36e-15 4.87e-03 0s 16 1.25592148e+02 1.10037735e+02 2.53e-04 1.34e-15 2.86e-03 0s 17 1.23610089e+02 1.14705813e+02 1.63e-04 1.21e-15 1.64e-03 0s 18 1.21987933e+02 1.15665618e+02 9.08e-05 1.40e-15 1.16e-03 0s 19 1.21380842e+02 1.18116900e+02 5.63e-05 1.28e-15 6.00e-04 0s 20 1.20632935e+02 1.18636546e+02 2.31e-05 1.39e-15 3.67e-04 0s 21 1.20450617e+02 1.19263333e+02 1.56e-05 1.43e-15 2.18e-04 0s 22 1.20227297e+02 1.19374503e+02 7.02e-06 1.69e-15 1.57e-04 0s 23 1.20109463e+02 1.19736758e+02 2.36e-06 1.34e-15 6.85e-05 0s 24 1.20071140e+02 1.19843471e+02 1.17e-06 1.29e-15 4.19e-05 0s 25 1.20044112e+02 1.19964156e+02 3.75e-07 1.04e-15 1.47e-05 0s 26 1.20032335e+02 1.20004479e+02 5.66e-08 1.02e-15 5.12e-06 0s 27 1.20029500e+02 1.20017682e+02 6.61e-09 1.05e-15 2.17e-06 0s 28 1.20029002e+02 1.20028868e+02 2.25e-11 9.38e-16 2.45e-08 0s 29 1.20029000e+02 1.20029000e+02 6.51e-12 1.11e-15 7.03e-14 0s Barrier solved model in 29 iterations and 0.12 seconds Optimal objective 1.20029000e+02 Root relaxation: objective 1.200290e+02, 945 iterations, 0.14 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 120.02900 0 51 1000.00000 120.02900 88.0% - 0s H 0 0 121.0000000 120.02900 0.80% - 0s Explored 0 nodes (2168 simplex iterations) in 0.31 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.210000000000e+02, best bound 1.210000000000e+02, gap 0.0% Preprocessing time: 0.06 seconds Gurobi run time: 0.31 seconds Total run time: 0.37 seconds Objective: 121 Solution: 1 x [1, 1, 2, 2, 4, 7] 35 x [1, 1, 2, 2, 7, 7, 7] 13 x [2, 2, 5, 5, 5, 5, 6, 6, 9, 9, 9] 2 x [1, 1, 2, 2, 2, 4, 4, 7] 4 x [1, 1, 2, 2, 2, 3, 3] 1 x [2, 2, 2, 2, 9, 9, 9, 9, 9] 3 x [2, 2, 2, 2, 9, 9, 9, 9, 9, 9, 9, 9] 31 x [3, 3, 6, 6, 6, 7, 8] 27 x [3, 5, 5, 8, 8, 8, 9, 9, 9, 10] 2 x [1, 1, 3, 6, 6, 6, 10, 10, 10] 1 x [5, 5, 5, 6, 6, 10, 10] 1 x [5, 10, 10, 10, 10]