Build (method = -2) #dp: 1593 Step-3' Graph: 67 vertices and 193 arcs (0.01s) Step-4' Graph: 25 vertices and 109 arcs (0.01s) #V4/#V3 = 0.37 #A4/#A3 = 0.56 Ready! (0.01s) Optimize a model with 35 rows, 110 columns and 289 nonzeros Presolve removed 8 rows and 12 columns Presolve time: 0.00s Presolved: 27 rows, 98 columns, 267 nonzeros Variable types: 0 continuous, 98 integer (0 binary) Found heuristic solution: objective 761.0000000 Optimize a model with 27 rows, 98 columns and 267 nonzeros Presolved: 27 rows, 98 columns, 267 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.240e+02 Factor NZ : 3.010e+02 Factor Ops : 4.081e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.21831276e+03 -1.11105986e+04 5.65e+03 1.11e-16 3.11e+02 0s 1 1.06276481e+03 -5.31952019e+03 4.94e+02 6.66e-16 4.68e+01 0s 2 4.82536382e+02 -6.90051404e+02 3.03e-02 3.89e-16 5.73e+00 0s 3 2.12701029e+02 -1.46820137e+01 3.78e-03 2.36e-16 1.11e+00 0s 4 1.78529827e+02 1.24547774e+02 1.00e-03 2.30e-16 2.63e-01 0s 5 1.67530548e+02 1.64963084e+02 1.02e-05 4.11e-16 1.25e-02 0s 6 1.66667330e+02 1.66665719e+02 1.03e-08 2.91e-16 7.86e-06 0s 7 1.66666667e+02 1.66666667e+02 1.21e-13 3.44e-16 7.90e-12 0s Barrier solved model in 7 iterations and 0.00 seconds Optimal objective 1.66666667e+02 Root relaxation: objective 1.666667e+02, 66 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 166.66667 0 8 761.00000 166.66667 78.1% - 0s H 0 0 167.0000000 166.66667 0.20% - 0s Explored 0 nodes (77 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.670000000000e+02, best bound 1.670000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.02 seconds Objective: 167 Solution: 1 x [2, 4, 5, 6, 10] 11 x [1, 3, 4, 4, 5, 6] 4 x [1, 4, 4, 5, 6, 8] 36 x [4, 4, 5, 6, 7, 10] 3 x [1, 3, 4, 5, 7, 7] 90 x [3, 4, 7, 8, 9, 10] 1 x [1, 4, 5, 7, 8, 10] 20 x [4, 4, 5, 7, 7, 9] 1 x [4, 4, 5, 7, 7]