Build (method = -2) #dp: 125 Step-3' Graph: 32 vertices and 91 arcs (0.00s) Step-4' Graph: 20 vertices and 67 arcs (0.00s) #V4/#V3 = 0.62 #A4/#A3 = 0.74 Ready! (0.00s) Optimize a model with 30 rows, 68 columns and 169 nonzeros Presolve removed 8 rows and 9 columns Presolve time: 0.00s Presolved: 22 rows, 59 columns, 148 nonzeros Variable types: 0 continuous, 59 integer (0 binary) Found heuristic solution: objective 93.0000000 Optimize a model with 22 rows, 59 columns and 148 nonzeros Presolved: 22 rows, 59 columns, 148 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 9.200e+01 Factor NZ : 2.030e+02 Factor Ops : 2.295e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.88650227e+02 -7.03711506e+02 2.73e+02 1.11e-16 2.03e+01 0s 1 1.05999066e+02 -2.12265635e+02 1.33e+01 4.44e-16 3.02e+00 0s 2 7.89706192e+01 -1.19750414e+01 8.49e-01 3.05e-16 7.53e-01 0s 3 6.41691360e+01 5.68734534e+01 1.07e-14 2.22e-16 5.94e-02 0s 4 6.21208407e+01 6.10845278e+01 1.07e-14 1.52e-16 8.43e-03 0s 5 6.20456624e+01 6.19660222e+01 1.42e-14 1.26e-16 6.47e-04 0s 6 6.20000029e+01 6.19998964e+01 2.13e-14 3.33e-16 8.66e-07 0s 7 6.20000000e+01 6.20000000e+01 2.13e-14 2.22e-16 1.99e-12 0s Barrier solved model in 7 iterations and 0.00 seconds Optimal objective 6.20000000e+01 Root relaxation: objective 6.200000e+01, 41 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 62.0000000 62.00000 0.0% - 0s Explored 0 nodes (41 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 6.200000000000e+01, best bound 6.200000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.02 seconds Objective: 62 Solution: 3 x [8] 6 x [3] 9 x [3, 5] 11 x [4] 6 x [7] 1 x [5, 7] 1 x [7, 9, 9, 9, 9] 1 x [7, 10, 10] 1 x [6] 13 x [2, 6] 1 x [1] 9 x [1, 1]