Build (method = -2) #dp: 2466 Step-3' Graph: 133 vertices and 448 arcs (0.01s) Step-4' Graph: 92 vertices and 366 arcs (0.01s) #V4/#V3 = 0.69 #A4/#A3 = 0.82 Ready! (0.01s) Optimize a model with 102 rows, 367 columns and 927 nonzeros Presolve removed 26 rows and 54 columns Presolve time: 0.00s Presolved: 76 rows, 313 columns, 828 nonzeros Variable types: 0 continuous, 313 integer (0 binary) Found heuristic solution: objective 98.0000000 Found heuristic solution: objective 93.0000000 Found heuristic solution: objective 71.0000000 Optimize a model with 76 rows, 313 columns and 828 nonzeros Presolved: 76 rows, 313 columns, 828 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.620e+02 Factor NZ : 1.349e+03 Factor Ops : 2.781e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.66769933e+02 -3.48785364e+03 3.91e+03 2.22e-16 3.81e+01 0s 1 1.97044911e+02 -1.64146732e+03 6.65e+02 4.44e-16 7.31e+00 0s 2 9.19250155e+01 -4.51162233e+02 7.83e+01 4.44e-16 1.21e+00 0s 3 5.33132076e+01 -1.14136123e+02 1.66e-01 3.05e-16 2.64e-01 0s 4 3.56230806e+01 -4.40097686e+01 4.84e-02 2.22e-16 1.25e-01 0s 5 2.71488673e+01 -9.34502840e+00 3.34e-02 2.60e-16 5.74e-02 0s 6 1.80075223e+01 5.74331293e+00 1.48e-02 1.99e-16 1.93e-02 0s 7 1.59281176e+01 1.09810694e+01 7.25e-03 2.22e-16 7.78e-03 0s 8 1.43938865e+01 1.40868495e+01 1.24e-05 2.22e-16 4.83e-04 0s 9 1.42859743e+01 1.42848162e+01 4.94e-08 2.22e-16 1.82e-06 0s 10 1.42857145e+01 1.42857134e+01 1.70e-14 1.97e-16 1.82e-09 0s 11 1.42857143e+01 1.42857143e+01 2.49e-13 1.42e-16 1.82e-12 0s Barrier solved model in 11 iterations and 0.00 seconds Optimal objective 1.42857143e+01 Root relaxation: objective 1.428571e+01, 190 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 14.28571 0 8 71.00000 14.28571 79.9% - 0s H 0 0 15.0000000 14.28571 4.76% - 0s Explored 0 nodes (323 simplex iterations) in 0.02 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.500000000000e+01, best bound 1.500000000000e+01, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.02 seconds Total run time: 0.03 seconds Objective: 15 Solution: 4 x [3, 3, 3, 4, 7, 8, 10] 2 x [3, 5, 5, 5, 5, 5, 7] 1 x [3, 5, 5, 5, 5, 5, 10] 1 x [3, 3, 3, 7, 8, 8, 10] 2 x [1, 2, 7, 7, 8, 8, 10] 4 x [1, 6, 7, 7, 8, 9, 10] 1 x [7, 7]