Build (method = -2) #dp: 3187 Step-3' Graph: 441 vertices and 1969 arcs (0.02s) Step-4' Graph: 375 vertices and 1836 arcs (0.02s) #V4/#V3 = 0.85 #A4/#A3 = 0.93 Ready! (0.02s) Optimize a model with 385 rows, 1837 columns and 4777 nonzeros Presolve removed 33 rows and 62 columns Presolve time: 0.02s Presolved: 352 rows, 1775 columns, 4709 nonzeros Variable types: 0 continuous, 1775 integer (106 binary) Found heuristic solution: objective 77.0000000 Found heuristic solution: objective 63.0000000 Optimize a model with 352 rows, 1775 columns and 4709 nonzeros Presolved: 352 rows, 1775 columns, 4709 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.766e+03 Factor NZ : 1.434e+04 Factor Ops : 9.318e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 8.74060194e+02 -3.55486054e+04 2.81e+04 5.13e-02 7.67e+01 0s 1 2.42185190e+02 -2.00449987e+04 4.06e+03 2.55e-15 1.42e+01 0s 2 1.44874264e+02 -5.95397141e+03 9.82e+02 1.83e-15 3.40e+00 0s 3 1.15143985e+02 -1.99973772e+03 1.56e+02 2.05e-15 8.13e-01 0s 4 1.05190977e+02 -5.24168389e+02 4.24e+01 3.44e-15 2.12e-01 0s 5 9.93125442e+01 -2.11092058e+02 1.82e+01 1.83e-15 9.62e-02 0s 6 9.64407710e+01 -1.91251872e+02 1.35e+01 1.96e-15 8.73e-02 0s 7 7.69541638e+01 -1.18027315e+02 8.80e+00 1.68e-15 5.84e-02 0s 8 5.50797187e+01 -8.87140757e+01 5.40e+00 1.63e-15 4.25e-02 0s 9 4.44315320e+01 -4.75300979e+01 4.12e+00 1.42e-15 2.73e-02 0s 10 3.03261504e+01 -4.02456223e+00 2.46e+00 8.98e-16 1.04e-02 0s 11 2.02793630e+01 2.02206325e+00 1.16e+00 1.09e-15 5.42e-03 0s 12 1.70035607e+01 5.86876725e+00 7.07e-01 1.12e-15 3.29e-03 0s 13 1.45815028e+01 8.40836626e+00 4.11e-01 1.28e-15 1.82e-03 0s 14 1.39563143e+01 9.65263155e+00 3.18e-01 1.23e-15 1.27e-03 0s 15 1.32383958e+01 1.09018286e+01 1.81e-01 1.20e-15 6.85e-04 0s 16 1.27481014e+01 1.16851354e+01 6.12e-02 1.49e-15 3.07e-04 0s 17 1.25574778e+01 1.20594606e+01 2.05e-02 1.11e-15 1.43e-04 0s 18 1.24823063e+01 1.21665179e+01 1.04e-02 1.35e-15 9.00e-05 0s 19 1.24444869e+01 1.22587551e+01 5.55e-03 1.42e-15 5.29e-05 0s 20 1.24326004e+01 1.23289403e+01 4.24e-03 1.13e-15 2.96e-05 0s 21 1.24221710e+01 1.23434178e+01 3.27e-03 1.19e-15 2.25e-05 0s 22 1.24075806e+01 1.23559056e+01 2.18e-03 1.46e-15 1.48e-05 0s 23 1.23952409e+01 1.23619123e+01 1.16e-03 1.56e-15 9.50e-06 0s 24 1.23835615e+01 1.23674245e+01 3.86e-04 1.45e-15 4.58e-06 0s 25 1.23823151e+01 1.23732439e+01 2.62e-04 1.16e-15 2.58e-06 0s 26 1.23789512e+01 1.23768359e+01 5.32e-05 9.04e-16 6.01e-07 0s 27 1.23780052e+01 1.23779831e+01 7.18e-13 8.83e-16 6.21e-09 0s 28 1.23780000e+01 1.23780000e+01 9.04e-13 8.78e-16 1.25e-14 0s Barrier solved model in 28 iterations and 0.06 seconds Optimal objective 1.23780000e+01 Root relaxation: objective 1.237800e+01, 358 iterations, 0.06 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 12.37800 0 50 63.00000 12.37800 80.4% - 0s H 0 0 13.0000000 12.37800 4.78% - 0s Explored 0 nodes (731 simplex iterations) in 0.16 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.300000000000e+01, best bound 1.300000000000e+01, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.16 seconds Total run time: 0.19 seconds Objective: 13 Solution: 1 x [1, 1, 1, 3, 8, 8, 10] 2 x [1, 3, 4, 4, 4, 4, 5, 8, 8] 1 x [2, 2, 2, 2, 3, 3, 9, 10] 2 x [2, 2, 2, 2, 2, 3, 3, 9, 10] 2 x [3, 3, 5, 9, 10, 10] 1 x [1, 3, 3, 3, 6, 7, 9] 3 x [1, 8, 8, 8, 8, 8, 9, 10] 1 x [1, 4, 4, 5, 7, 9]