Build (method = -2) #dp: 8137 Step-3' Graph: 105 vertices and 304 arcs (0.04s) Step-4' Graph: 10 vertices and 114 arcs (0.04s) #V4/#V3 = 0.10 #A4/#A3 = 0.38 Ready! (0.04s) Optimize a model with 30 rows, 115 columns and 333 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 28 rows, 113 columns, 329 nonzeros Variable types: 0 continuous, 113 integer (10 binary) Found heuristic solution: objective 197.0000000 Found heuristic solution: objective 193.0000000 Optimize a model with 28 rows, 113 columns and 329 nonzeros Presolved: 28 rows, 113 columns, 329 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.210e+02 Factor NZ : 4.060e+02 Factor Ops : 7.714e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.00267680e+03 -1.25400711e+03 2.71e+02 4.76e-02 3.68e+01 0s 1 2.04993662e+02 -6.62661370e+02 1.63e+01 4.44e-16 4.98e+00 0s 2 9.42907062e+01 -4.22308469e+01 6.84e-14 1.11e-15 5.65e-01 0s 3 4.34487980e+01 2.05807780e+01 3.55e-14 3.33e-16 9.38e-02 0s 4 4.03508174e+01 3.86316865e+01 2.98e-14 3.33e-16 7.05e-03 0s 5 4.00016381e+01 3.99894256e+01 4.85e-14 3.33e-16 5.01e-05 0s 6 4.00000000e+01 4.00000000e+01 2.93e-14 2.22e-16 9.48e-11 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 4.00000000e+01 Root relaxation: objective 4.000000e+01, 99 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 40.0000000 40.00000 0.0% - 0s Explored 0 nodes (99 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 4.000000000000e+01, best bound 4.000000000000e+01, gap 0.0% Preprocessing time: 0.04 seconds Gurobi run time: 0.00 seconds Total run time: 0.05 seconds Objective: 40 Solution: 5 x [2, 4, 4, 12, 15] 1 x [3, 7, 13, 18, 20] 6 x [9, 11, 13, 14, 17] 12 x [1, 5, 6, 10, 14] 2 x [6, 7, 7, 9, 19] 3 x [1, 4, 10, 12, 17] 10 x [7, 8, 12, 16, 20] 1 x [4, 4, 4, 7, 15]