Build (method = -2) #dp: 3111 Step-3' Graph: 88 vertices and 254 arcs (0.01s) Step-4' Graph: 16 vertices and 110 arcs (0.01s) #V4/#V3 = 0.18 #A4/#A3 = 0.43 Ready! (0.01s) Optimize a model with 35 rows, 111 columns and 308 nonzeros Presolve removed 5 rows and 8 columns Presolve time: 0.00s Presolved: 30 rows, 103 columns, 292 nonzeros Variable types: 0 continuous, 103 integer (0 binary) Found heuristic solution: objective 199.0000000 Found heuristic solution: objective 186.0000000 Optimize a model with 30 rows, 103 columns and 292 nonzeros Presolved: 30 rows, 103 columns, 292 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.140e+02 Factor NZ : 3.360e+02 Factor Ops : 5.120e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.08015634e+02 -8.49382262e+02 1.67e+02 0.00e+00 1.69e+01 0s 1 1.31302740e+02 -3.29867140e+02 2.20e+00 1.67e-15 2.22e+00 0s 2 8.07575818e+01 -6.71422436e+01 2.20e-01 9.99e-16 6.70e-01 0s 3 5.16402689e+01 4.03473189e+01 9.89e-04 1.11e-15 5.02e-02 0s 4 5.01077667e+01 4.91669252e+01 4.96e-05 1.03e-15 4.18e-03 0s 5 5.00000445e+01 4.99997613e+01 3.88e-09 5.91e-16 1.26e-06 0s 6 5.00000000e+01 5.00000000e+01 2.61e-14 1.21e-15 1.26e-12 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 5.00000000e+01 Root relaxation: objective 5.000000e+01, 84 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 50.0000000 50.00000 0.0% - 0s Explored 0 nodes (84 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 5.000000000000e+01, best bound 5.000000000000e+01, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.00 seconds Total run time: 0.02 seconds Objective: 50 Solution: 3 x [6, 13, 14, 19] 1 x [3, 5, 13, 16] 13 x [6, 9, 13, 15] 7 x [5, 10, 11, 18] 9 x [5, 8, 12, 16] 1 x [3, 5, 6, 18] 11 x [2, 2, 17, 19] 2 x [4, 11, 18, 19] 2 x [1, 7, 18, 19] 1 x [2, 3, 7, 18]