Build (method = -2) #dp: 6266 Step-3' Graph: 103 vertices and 298 arcs (0.03s) Step-4' Graph: 13 vertices and 118 arcs (0.03s) #V4/#V3 = 0.13 #A4/#A3 = 0.40 Ready! (0.03s) Optimize a model with 32 rows, 119 columns and 339 nonzeros Presolve removed 4 rows and 6 columns Presolve time: 0.00s Presolved: 28 rows, 113 columns, 328 nonzeros Variable types: 0 continuous, 113 integer (5 binary) Found heuristic solution: objective 198.0000000 Found heuristic solution: objective 127.0000000 Optimize a model with 28 rows, 113 columns and 328 nonzeros Presolved: 28 rows, 113 columns, 328 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.220e+02 Factor NZ : 3.300e+02 Factor Ops : 5.130e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 9.99086085e+02 -1.24603671e+03 3.27e+02 5.21e-02 3.84e+01 0s 1 2.13921371e+02 -6.71563058e+02 2.16e+01 4.44e-16 5.28e+00 0s 2 9.53110950e+01 -5.58353430e+01 1.11e-03 4.44e-16 6.25e-01 0s 3 4.34618938e+01 2.13418810e+01 8.35e-05 3.33e-16 9.07e-02 0s 4 4.05719635e+01 3.91763743e+01 1.30e-05 2.26e-16 5.72e-03 0s 5 4.00035965e+01 3.99902998e+01 5.91e-08 2.22e-16 5.45e-05 0s 6 4.00000000e+01 4.00000000e+01 1.39e-13 2.45e-16 7.60e-11 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 4.00000000e+01 Root relaxation: objective 4.000000e+01, 97 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 (97 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.03 seconds Gurobi run time: 0.00 seconds Total run time: 0.04 seconds Objective: 40 Solution: 13 x [7, 9, 10, 14, 19] 2 x [1, 6, 9, 10, 11] 1 x [1, 1, 2, 5, 11] 1 x [3, 4, 5, 11, 19] 10 x [3, 8, 12, 17, 18] 1 x [1, 7, 12, 14, 17] 8 x [1, 6, 13, 16, 19] 4 x [1, 4, 11, 15, 18]