Build (method = -2) #dp: 506 Step-3' Graph: 65 vertices and 278 arcs (0.00s) Step-4' Graph: 60 vertices and 268 arcs (0.00s) #V4/#V3 = 0.92 #A4/#A3 = 0.96 Ready! (0.00s) Optimize a model with 70 rows, 269 columns and 691 nonzeros Presolve removed 13 rows and 23 columns Presolve time: 0.00s Presolved: 57 rows, 246 columns, 653 nonzeros Variable types: 0 continuous, 246 integer (0 binary) Found heuristic solution: objective 89.0000000 Found heuristic solution: objective 63.0000000 Optimize a model with 57 rows, 246 columns and 653 nonzeros Presolved: 57 rows, 246 columns, 653 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.830e+02 Factor NZ : 1.104e+03 Factor Ops : 2.554e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.56536168e+02 -4.54820545e+03 2.41e+03 2.22e-16 5.48e+01 0s 1 1.82916081e+02 -2.11973221e+03 3.20e+02 8.88e-16 9.47e+00 0s 2 9.81658927e+01 -5.18222491e+02 1.99e+01 9.33e-15 1.42e+00 0s 3 7.41719298e+01 -1.35112972e+02 9.40e-02 2.89e-15 4.20e-01 0s 4 5.71541164e+01 -1.94745295e+01 1.30e-02 8.88e-16 1.54e-01 0s 5 4.28350900e+01 1.00278788e+01 4.35e-03 4.44e-16 6.58e-02 0s 6 3.56262166e+01 1.79195707e+01 1.59e-03 2.22e-16 3.55e-02 0s 7 3.55636054e+01 2.37669157e+01 1.14e-03 1.38e-16 2.36e-02 0s 8 3.29483327e+01 2.93888178e+01 3.10e-04 2.09e-16 7.13e-03 0s 9 3.20435509e+01 3.03955052e+01 1.23e-04 1.68e-16 3.30e-03 0s 10 3.15899831e+01 3.10256262e+01 2.51e-05 2.22e-16 1.13e-03 0s 11 3.14299325e+01 3.12836314e+01 5.31e-06 2.47e-16 2.93e-04 0s 12 3.13792470e+01 3.13707324e+01 3.66e-07 1.76e-16 1.71e-05 0s 13 3.13750018e+01 3.13749958e+01 4.78e-11 2.71e-16 1.20e-08 0s 14 3.13750000e+01 3.13750000e+01 2.10e-13 3.32e-16 1.21e-14 0s Barrier solved model in 14 iterations and 0.00 seconds Optimal objective 3.13750000e+01 Root relaxation: objective 3.137500e+01, 70 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 31.37500 0 6 63.00000 31.37500 50.2% - 0s H 0 0 32.0000000 31.37500 1.95% - 0s Explored 0 nodes (117 simplex iterations) in 0.01 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 3.200000000000e+01, best bound 3.200000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.01 seconds Total run time: 0.03 seconds Objective: 32 Solution: 1 x [2, 4, 6] 10 x [1, 4, 9] 3 x [4, 5, 10] 4 x [1, 7, 8] 1 x [2, 3, 8] 3 x [2, 3, 3, 8] 1 x [2, 2, 8] 3 x [5, 5, 8, 9] 3 x [8, 8] 1 x [2, 2] 2 x [2, 2, 2, 9]