Build (method = -2) #dp: 7381 Step-3' Graph: 716 vertices and 3274 arcs (0.05s) Step-4' Graph: 551 vertices and 2947 arcs (0.05s) #V4/#V3 = 0.77 #A4/#A3 = 0.90 Ready! (0.05s) Optimize a model with 563 rows, 2948 columns and 7752 nonzeros Presolve removed 44 rows and 86 columns Presolve time: 0.03s Presolved: 519 rows, 2862 columns, 7612 nonzeros Variable types: 0 continuous, 2862 integer (0 binary) Found heuristic solution: objective 528.0000000 Optimize a model with 519 rows, 2862 columns and 7612 nonzeros Presolved: 519 rows, 2862 columns, 7612 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.375e+03 Factor NZ : 1.898e+04 (roughly 2 MBytes of memory) Factor Ops : 9.173e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.10920925e+03 -2.24304136e+05 2.59e+05 2.22e-16 4.42e+02 0s 1 1.43352134e+03 -1.54528777e+05 3.58e+04 6.66e-16 7.99e+01 0s 2 8.23869354e+02 -4.95085461e+04 9.40e+03 2.44e-15 2.10e+01 0s 3 6.24589583e+02 -1.98840666e+04 2.80e+03 5.33e-15 6.71e+00 0s 4 5.51312545e+02 -6.70049337e+03 6.90e+02 7.99e-15 1.86e+00 0s 5 5.24909895e+02 -2.33900361e+03 1.37e+01 2.22e-15 5.06e-01 0s 6 5.11003320e+02 -1.10785402e+03 1.27e-11 9.99e-16 2.82e-01 0s 7 4.16760513e+02 -8.43458307e+02 9.58e-12 8.88e-16 2.20e-01 0s 8 3.07809443e+02 -5.52006006e+02 7.44e-12 8.88e-16 1.50e-01 0s 9 1.72410416e+02 -2.62563953e+02 1.42e-11 4.44e-16 7.58e-02 0s 10 1.33894838e+02 -2.06402216e+02 1.01e-11 3.33e-16 5.93e-02 0s 11 1.16204382e+02 -1.29019799e+02 8.20e-12 4.44e-16 4.28e-02 0s 12 9.35754545e+01 -5.33380239e+01 5.40e-12 3.33e-16 2.56e-02 0s 13 7.50061267e+01 -1.01883173e+01 3.21e-12 2.40e-16 1.49e-02 0s 14 6.19135339e+01 1.85826811e+01 6.56e-12 2.51e-16 7.55e-03 0s 15 5.78760734e+01 3.21540635e+01 4.85e-12 3.20e-16 4.48e-03 0s 16 5.54164410e+01 4.63614238e+01 3.19e-12 2.85e-16 1.58e-03 0s 17 5.36693776e+01 5.14573647e+01 1.65e-12 3.55e-16 3.86e-04 0s 18 5.37392335e+01 5.20517101e+01 1.48e-12 2.59e-16 2.94e-04 0s 19 5.28266728e+01 5.27042581e+01 2.92e-12 3.58e-16 2.13e-05 0s 20 5.28007361e+01 5.27995907e+01 6.64e-12 3.77e-16 2.00e-07 0s 21 5.28000000e+01 5.28000000e+01 1.69e-12 3.58e-16 2.23e-13 0s Barrier solved model in 21 iterations and 0.06 seconds Optimal objective 5.28000000e+01 Root relaxation: objective 5.280000e+01, 1755 iterations, 0.08 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 52.80000 0 41 528.00000 52.80000 90.0% - 0s H 0 0 54.0000000 52.80000 2.22% - 0s H 0 0 53.0000000 52.80000 0.38% - 0s Explored 0 nodes (2497 simplex iterations) in 0.25 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 5.300000000000e+01, best bound 5.300000000000e+01, gap 0.0% Preprocessing time: 0.06 seconds Gurobi run time: 0.25 seconds Total run time: 0.31 seconds Objective: 53 Solution: 3 x [1, 4, 4, 5, 7, 7, 7, 7, 11, 12] 1 x [1, 4, 4, 4, 5, 7, 7, 7, 12] 1 x [1, 1, 3, 4, 7, 7, 7, 7, 7, 10] 1 x [1, 1, 3, 6, 7, 7, 7, 7, 10, 11] 1 x [1, 1, 3, 6, 7, 7, 7, 7, 10] 5 x [1, 1, 4, 7, 7, 7, 7, 7, 7, 7] 7 x [4, 4, 4, 5, 7, 7, 7, 7, 8, 10] 3 x [4, 4, 4, 4, 5, 7, 7, 7, 12, 12] 13 x [4, 4, 5, 5, 7, 7, 7, 7, 7, 8] 4 x [2, 2, 2, 4, 4, 6, 6, 6, 6, 7] 10 x [4, 4, 4, 4, 4, 4, 4, 7, 7, 7] 3 x [3, 3, 3, 3, 3, 6, 6, 6, 6, 7] 1 x [7, 7, 7, 7, 9, 9, 9, 9, 9, 9]