Build (method = -2) #dp: 51 Step-3' Graph: 16 vertices and 41 arcs (0.00s) Step-4' Graph: 9 vertices and 27 arcs (0.00s) #V4/#V3 = 0.56 #A4/#A3 = 0.66 Ready! (0.00s) Optimize a model with 18 rows, 28 columns and 70 nonzeros Presolve removed 8 rows and 8 columns Presolve time: 0.00s Presolved: 10 rows, 20 columns, 48 nonzeros Variable types: 0 continuous, 20 integer (4 binary) Found heuristic solution: objective 61.0000000 Found heuristic solution: objective 58.0000000 Optimize a model with 10 rows, 20 columns and 48 nonzeros Presolve removed 4 rows and 10 columns Presolved: 6 rows, 10 columns, 26 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.300e+01 Factor NZ : 2.100e+01 Factor Ops : 9.100e+01 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.70000000e+01 4.55000000e+01 7.22e+01 0.00e+00 1.53e+00 0s 1 5.70000000e+01 5.41763329e+01 1.78e-14 6.94e-17 1.34e-01 0s 2 5.70000000e+01 5.69971763e+01 1.78e-15 2.17e-17 1.34e-04 0s 3 5.70000000e+01 5.69999972e+01 2.31e-14 2.17e-18 1.34e-07 0s 4 5.70000000e+01 5.70000000e+01 3.55e-15 1.42e-17 1.34e-10 0s Barrier solved model in 4 iterations and 0.00 seconds Optimal objective 5.70000000e+01 Root relaxation: objective 5.700000e+01, 11 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 57.0000000 57.00000 0.0% - 0s Explored 0 nodes (11 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 5.700000000000e+01, best bound 5.700000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 57 Solution: 18 x [1, 8] 15 x [1, 9] 11 x [2] 5 x [3] 1 x [4] 2 x [4, 8, 9] 4 x [5, 6] 1 x [5, 7, 9]