Build (method = -2) #dp: 1623 Step-3' Graph: 74 vertices and 211 arcs (0.01s) Step-4' Graph: 26 vertices and 115 arcs (0.01s) #V4/#V3 = 0.35 #A4/#A3 = 0.55 Ready! (0.01s) Optimize a model with 36 rows, 116 columns and 305 nonzeros Presolve removed 10 rows and 18 columns Presolve time: 0.00s Presolved: 26 rows, 98 columns, 271 nonzeros Variable types: 0 continuous, 98 integer (0 binary) Found heuristic solution: objective 83.0000000 Found heuristic solution: objective 48.0000000 Optimize a model with 26 rows, 98 columns and 271 nonzeros Presolved: 26 rows, 98 columns, 271 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.240e+02 Factor NZ : 2.710e+02 Factor Ops : 3.401e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.36416617e+02 -1.09819878e+03 4.19e+02 1.11e-16 2.91e+01 0s 1 1.21751085e+02 -4.99253834e+02 5.09e+01 4.44e-16 5.00e+00 0s 2 4.97935838e+01 -6.68168219e+01 1.31e-02 3.33e-16 5.68e-01 0s 3 2.09696547e+01 9.82591996e-01 1.32e-03 2.22e-16 9.70e-02 0s 4 1.74451294e+01 1.38846501e+01 3.42e-04 3.33e-16 1.73e-02 0s 5 1.66917488e+01 1.65353530e+01 9.30e-07 2.37e-16 7.59e-04 0s 6 1.66666696e+01 1.66666386e+01 4.21e-11 2.09e-16 1.51e-07 0s 7 1.66666667e+01 1.66666667e+01 1.39e-14 3.33e-16 1.52e-13 0s Barrier solved model in 7 iterations and 0.00 seconds Optimal objective 1.66666667e+01 Root relaxation: objective 1.666667e+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 16.66667 0 14 48.00000 16.66667 65.3% - 0s H 0 0 17.0000000 16.66667 1.96% - 0s Explored 0 nodes (91 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.700000000000e+01, best bound 1.700000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.02 seconds Objective: 17 Solution: 4 x [3, 3, 3, 4, 7, 9] 1 x [2, 3, 3, 7, 8] 1 x [2, 2, 3, 3, 7, 8] 4 x [1, 4, 5, 6, 8, 8] 1 x [1, 4, 5, 6, 10] 1 x [1, 7, 8, 8, 8, 10] 5 x [1, 1, 4, 6, 7, 10]