Build (method = -2) #dp: 153 Step-3' Graph: 36 vertices and 101 arcs (0.00s) Step-4' Graph: 24 vertices and 77 arcs (0.00s) #V4/#V3 = 0.67 #A4/#A3 = 0.76 Ready! (0.00s) Optimize a model with 34 rows, 78 columns and 190 nonzeros Presolve removed 8 rows and 14 columns Presolve time: 0.00s Presolved: 26 rows, 64 columns, 162 nonzeros Variable types: 0 continuous, 64 integer (0 binary) Found heuristic solution: objective 431.0000000 Optimize a model with 26 rows, 64 columns and 162 nonzeros Presolved: 26 rows, 64 columns, 162 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.090e+02 Factor NZ : 2.870e+02 Factor Ops : 3.833e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.93384416e+03 -7.07031630e+03 4.44e+03 1.11e-16 2.24e+02 0s 1 8.17845913e+02 -2.13015505e+03 4.18e+02 5.55e-16 3.19e+01 0s 2 5.19052485e+02 -4.86518251e+02 3.48e+01 3.33e-15 7.86e+00 0s 3 3.84640387e+02 2.04786407e+02 6.26e-01 4.16e-16 1.33e+00 0s 4 3.04585927e+02 2.33702283e+02 7.34e-02 5.13e-16 5.25e-01 0s 5 2.91912773e+02 2.69530672e+02 2.31e-02 4.67e-16 1.66e-01 0s 6 2.87215569e+02 2.79674794e+02 6.75e-03 5.11e-16 5.59e-02 0s 7 2.84512012e+02 2.82232521e+02 1.39e-03 4.72e-16 1.69e-02 0s 8 2.83800057e+02 2.83401213e+02 1.14e-04 3.33e-16 2.95e-03 0s 9 2.83653971e+02 2.83618174e+02 2.00e-05 5.27e-16 2.65e-04 0s 10 2.83639626e+02 2.83638585e+02 2.17e-11 5.99e-16 7.72e-06 0s 11 2.83638890e+02 2.83638889e+02 1.12e-11 2.36e-16 7.88e-09 0s 12 2.83638889e+02 2.83638889e+02 7.40e-12 4.03e-16 7.88e-12 0s Barrier solved model in 12 iterations and 0.00 seconds Optimal objective 2.83638889e+02 Root relaxation: objective 2.836389e+02, 8 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 283.63889 0 23 431.00000 283.63889 34.2% - 0s H 0 0 285.0000000 283.63889 0.48% - 0s H 0 0 284.0000000 283.63889 0.13% - 0s Explored 0 nodes (9 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.840000000000e+02, best bound 2.840000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 284 Solution: 17 x [1, 4] 61 x [1, 5] 13 x [1, 6, 10] 83 x [2, 3, 7, 10] 7 x [2, 4, 5, 10] 1 x [2, 6, 7] 61 x [2, 6, 8, 9] 7 x [3, 4, 5, 7] 32 x [3, 4, 5, 9, 10] 1 x [3, 4, 8, 10] 1 x [4, 5, 7, 8, 9, 10]