Build (method = -2) #dp: 6895 Step-3' Graph: 549 vertices and 3045 arcs (0.04s) Step-4' Graph: 526 vertices and 2999 arcs (0.04s) #V4/#V3 = 0.96 #A4/#A3 = 0.98 Ready! (0.04s) Optimize a model with 538 rows, 3000 columns and 7969 nonzeros Presolve removed 42 rows and 80 columns Presolve time: 0.04s Presolved: 496 rows, 2920 columns, 7878 nonzeros Variable types: 0 continuous, 2920 integer (0 binary) Found heuristic solution: objective 440.0000000 Optimize a model with 496 rows, 2920 columns and 7878 nonzeros Presolved: 496 rows, 2920 columns, 7878 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.644e+03 Factor NZ : 2.530e+04 (roughly 2 MBytes of memory) Factor Ops : 2.396e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.24145286e+03 -1.88879612e+05 1.72e+05 2.22e-16 3.30e+02 0s 1 1.33484683e+03 -1.05930770e+05 2.89e+04 6.66e-16 6.43e+01 0s 2 7.33377858e+02 -3.84386268e+04 7.50e+03 1.20e-14 1.72e+01 0s 3 5.27239112e+02 -1.13700308e+04 8.86e+02 6.22e-15 3.04e+00 0s 4 4.94111041e+02 -2.40733654e+03 5.61e+01 7.11e-15 5.31e-01 0s 5 4.83582097e+02 -1.23752489e+03 1.41e-01 3.77e-15 2.94e-01 0s 6 4.10689151e+02 -1.24083212e+03 9.96e-02 3.44e-15 2.82e-01 0s 7 3.39669764e+02 -6.42525141e+02 6.96e-02 1.78e-15 1.68e-01 0s 8 2.72678053e+02 -2.94053297e+02 4.72e-02 1.44e-15 9.69e-02 0s 9 2.33969847e+02 -1.83363302e+02 3.67e-02 1.15e-15 7.13e-02 0s 10 1.91316807e+02 -1.15835212e+02 2.76e-02 1.27e-15 5.25e-02 0s 11 1.40178323e+02 -4.18579275e+01 1.77e-02 1.39e-15 3.11e-02 0s 12 9.56125845e+01 -1.64891066e+01 8.80e-03 1.44e-15 1.92e-02 0s 13 7.01211064e+01 1.19987742e+01 3.80e-03 1.26e-15 9.93e-03 0s 14 6.09081114e+01 3.13330357e+01 2.14e-03 1.15e-15 5.05e-03 0s 15 5.84437476e+01 3.94464083e+01 1.39e-03 1.32e-15 3.25e-03 0s 16 5.63744603e+01 4.59573677e+01 7.84e-04 1.17e-15 1.78e-03 0s 17 5.57553265e+01 4.88699006e+01 3.65e-04 1.45e-15 1.18e-03 0s 18 5.49766047e+01 5.08356273e+01 2.00e-04 1.36e-15 7.08e-04 0s 19 5.42092931e+01 5.19942618e+01 4.11e-05 1.33e-15 3.79e-04 0s 20 5.39127455e+01 5.30958880e+01 9.71e-06 1.10e-15 1.40e-04 0s 21 5.38964471e+01 5.31851043e+01 8.84e-06 1.79e-15 1.22e-04 0s 22 5.38651632e+01 5.34180514e+01 6.65e-06 1.69e-15 7.64e-05 0s 23 5.38318410e+01 5.35329544e+01 4.70e-06 1.36e-15 5.11e-05 0s 24 5.37858635e+01 5.36362634e+01 1.83e-06 1.59e-15 2.56e-05 0s 25 5.37712521e+01 5.36796761e+01 1.15e-06 1.45e-15 1.56e-05 0s 26 5.37543018e+01 5.37084653e+01 4.25e-07 1.21e-15 7.83e-06 0s 27 5.37479597e+01 5.37323552e+01 2.11e-07 1.29e-15 2.67e-06 0s 28 5.37412410e+01 5.37397932e+01 2.16e-09 8.78e-16 2.47e-07 0s 29 5.37408108e+01 5.37408035e+01 2.48e-11 8.86e-16 1.25e-09 0s 30 5.37408088e+01 5.37408088e+01 1.55e-11 8.29e-16 1.46e-15 0s Barrier solved model in 30 iterations and 0.12 seconds Optimal objective 5.37408088e+01 Root relaxation: objective 5.374081e+01, 715 iterations, 0.13 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 53.74081 0 42 440.00000 53.74081 87.8% - 0s H 0 0 55.0000000 53.74081 2.29% - 0s H 0 0 54.0000000 53.74081 0.48% - 0s Explored 0 nodes (1564 simplex iterations) in 0.32 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 5.400000000000e+01, best bound 5.400000000000e+01, gap 0.0% Preprocessing time: 0.07 seconds Gurobi run time: 0.32 seconds Total run time: 0.39 seconds Objective: 54 Solution: 1 x [1, 1, 2, 5, 5, 5, 8, 11, 11] 7 x [2, 5, 5, 5, 6, 8, 11, 11, 11, 11] 1 x [3, 5, 5, 5, 6, 8, 9, 11, 11] 13 x [4, 4, 5, 5, 5, 8, 8, 9] 4 x [1, 3, 4, 5, 5, 5, 5, 11, 11, 12] 1 x [1, 3, 4, 4, 5, 5, 5] 1 x [1, 3, 4, 4, 4, 5, 5, 5] 13 x [5, 5, 5, 5, 5, 5, 5, 7, 9, 9] 5 x [5, 5, 5, 5, 5, 5, 5, 5, 7] 2 x [3, 5, 5, 5, 5, 10, 10, 10, 10] 6 x [5, 5, 5, 5, 5, 5, 5, 6, 6]