Build (method = -2) #dp: 1089 Step-3' Graph: 37 vertices and 239 arcs (0.00s) Step-4' Graph: 27 vertices and 219 arcs (0.00s) #V4/#V3 = 0.73 #A4/#A3 = 0.92 Ready! (0.00s) Optimize a model with 47 rows, 220 columns and 614 nonzeros Presolve removed 2 rows and 3 columns Presolve time: 0.00s Presolved: 45 rows, 217 columns, 608 nonzeros Variable types: 0 continuous, 217 integer (14 binary) Found heuristic solution: objective 109.0000000 Optimize a model with 45 rows, 217 columns and 608 nonzeros Presolved: 45 rows, 217 columns, 608 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.300e+02 Factor NZ : 7.580e+02 Factor Ops : 1.511e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.32199589e+03 -1.89558750e+03 1.30e+03 6.36e-02 4.27e+01 0s 1 2.92082592e+02 -9.95950195e+02 1.38e+02 5.55e-16 6.01e+00 0s 2 9.87305568e+01 -2.73885108e+02 8.73e+00 6.66e-16 9.40e-01 0s 3 4.43810333e+01 -1.91879696e+01 6.88e-03 3.33e-16 1.40e-01 0s 4 2.86619506e+01 5.55498504e+00 1.40e-03 2.41e-16 5.10e-02 0s 5 2.42796322e+01 1.57187750e+01 2.58e-04 2.22e-16 1.89e-02 0s 6 2.30560963e+01 2.14703242e+01 9.47e-05 2.22e-16 3.50e-03 0s 7 2.26118855e+01 2.25707147e+01 8.76e-07 2.22e-16 9.09e-05 0s 8 2.26000120e+01 2.25999708e+01 5.85e-14 3.33e-16 9.09e-08 0s 9 2.26000000e+01 2.26000000e+01 9.70e-14 2.64e-16 9.28e-14 0s Barrier solved model in 9 iterations and 0.00 seconds Optimal objective 2.26000000e+01 Root relaxation: objective 2.260000e+01, 150 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 22.60000 0 18 109.00000 22.60000 79.3% - 0s H 0 0 25.0000000 22.60000 9.60% - 0s 0 0 22.60000 0 30 25.00000 22.60000 9.60% - 0s H 0 0 23.0000000 22.60000 1.74% - 0s Cutting planes: Gomory: 2 Explored 0 nodes (214 simplex iterations) in 0.02 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.300000000000e+01, best bound 2.300000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.02 seconds Total run time: 0.03 seconds Objective: 23 Solution: 2 x [2, 11, 15, 16, 18] 3 x [1, 2, 8, 15, 20] 1 x [2, 9, 11, 11, 15] 1 x [1, 5, 6, 12, 20] 3 x [5, 6, 9, 12, 17] 1 x [5, 6, 9, 12] 3 x [6, 9, 10, 13, 13] 1 x [1, 5, 6, 8, 13] 1 x [3, 3, 3, 6, 19] 1 x [4, 5, 8, 11, 14] 4 x [7, 11, 14, 14, 16] 1 x [4, 5, 7, 8, 11] 1 x [3, 3, 3, 9]