Build (method = -2) #dp: 1806 Step-3' Graph: 80 vertices and 230 arcs (0.01s) Step-4' Graph: 12 vertices and 94 arcs (0.01s) #V4/#V3 = 0.15 #A4/#A3 = 0.41 Ready! (0.01s) Optimize a model with 30 rows, 95 columns and 268 nonzeros Presolve removed 5 rows and 8 columns Presolve time: 0.00s Presolved: 25 rows, 87 columns, 252 nonzeros Variable types: 0 continuous, 87 integer (0 binary) Found heuristic solution: objective 199.0000000 Found heuristic solution: objective 161.0000000 Optimize a model with 25 rows, 87 columns and 252 nonzeros Presolved: 25 rows, 87 columns, 252 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 9.200e+01 Factor NZ : 2.870e+02 Factor Ops : 4.385e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.17004164e+02 -8.86240412e+02 1.06e+02 1.11e-16 1.95e+01 0s 1 1.27334193e+02 -3.38083961e+02 1.42e-13 2.22e-16 2.51e+00 0s 2 8.13525075e+01 -1.50918629e+01 1.07e-14 4.44e-16 5.08e-01 0s 3 5.03920890e+01 4.16651776e+01 1.43e-13 3.33e-16 4.55e-02 0s 4 5.00523296e+01 4.99643644e+01 3.50e-14 4.44e-16 4.58e-04 0s 5 5.00000008e+01 4.99999950e+01 3.33e-14 5.55e-16 3.03e-08 0s 6 5.00000000e+01 5.00000000e+01 4.07e-14 3.33e-16 4.13e-14 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 5.00000000e+01 Root relaxation: objective 5.000000e+01, 75 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 (75 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: 14 x [2, 7, 14, 18] 2 x [4, 7, 11, 16] 3 x [6, 12, 16, 18] 8 x [6, 10, 16, 16] 4 x [5, 11, 15, 16] 11 x [5, 8, 9, 12] 1 x [9, 12, 13, 16] 1 x [4, 12, 13, 16] 3 x [1, 13, 16, 17] 3 x [3, 13, 16, 17]