Build (method = -2) #dp: 6941 Step-3' Graph: 104 vertices and 301 arcs (0.03s) Step-4' Graph: 14 vertices and 121 arcs (0.03s) #V4/#V3 = 0.13 #A4/#A3 = 0.40 Ready! (0.03s) Optimize a model with 33 rows, 122 columns and 346 nonzeros Presolve removed 6 rows and 10 columns Presolve time: 0.00s Presolved: 27 rows, 112 columns, 327 nonzeros Variable types: 0 continuous, 112 integer (0 binary) Found heuristic solution: objective 199.0000000 Found heuristic solution: objective 145.0000000 Optimize a model with 27 rows, 112 columns and 327 nonzeros Presolved: 27 rows, 112 columns, 327 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.190e+02 Factor NZ : 3.380e+02 Factor Ops : 5.610e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.53216364e+02 -1.26021688e+03 1.57e+02 2.22e-16 2.47e+01 0s 1 1.37136334e+02 -5.76541473e+02 9.90e-01 3.33e-16 3.13e+00 0s 2 9.43189907e+01 -1.43222424e+02 3.49e-02 3.33e-16 1.00e+00 0s 3 5.38478254e+01 1.74744190e+01 3.81e-05 2.22e-16 1.50e-01 0s 4 4.12180931e+01 3.78439004e+01 2.09e-06 1.11e-16 1.39e-02 0s 5 4.00062853e+01 3.99792756e+01 2.70e-09 3.33e-16 1.11e-04 0s 6 4.00000000e+01 4.00000000e+01 2.29e-14 2.22e-16 2.38e-10 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 4.00000000e+01 Root relaxation: objective 4.000000e+01, 98 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 (98 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.04 seconds Objective: 40 Solution: 1 x [5, 6, 7, 11, 16] 3 x [5, 9, 10, 14, 18] 8 x [3, 5, 8, 12, 12] 7 x [2, 7, 8, 11, 16] 10 x [1, 3, 4, 6, 17] 6 x [7, 10, 13, 17, 19] 2 x [2, 8, 9, 10, 14] 1 x [1, 2, 10, 12, 19] 2 x [6, 10, 10, 15, 15]