Build (method = -2) #dp: 904 Step-3' Graph: 53 vertices and 150 arcs (0.00s) Step-4' Graph: 10 vertices and 64 arcs (0.00s) #V4/#V3 = 0.19 #A4/#A3 = 0.43 Ready! (0.00s) Optimize a model with 20 rows, 65 columns and 181 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 18 rows, 63 columns, 177 nonzeros Variable types: 0 continuous, 63 integer (0 binary) Found heuristic solution: objective 96.0000000 Found heuristic solution: objective 84.0000000 Optimize a model with 18 rows, 63 columns and 177 nonzeros Presolved: 18 rows, 63 columns, 177 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 7.000e+01 Factor NZ : 1.710e+02 Factor Ops : 2.109e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.37150790e+02 -7.15812579e+02 1.28e+02 2.22e-16 2.03e+01 0s 1 9.80416194e+01 -2.40105945e+02 3.03e+00 3.33e-16 2.76e+00 0s 2 4.37426603e+01 -2.34993982e+01 1.01e-01 3.33e-16 5.03e-01 0s 3 2.17589791e+01 1.32187224e+01 9.23e-04 1.80e-16 6.28e-02 0s 4 2.01580412e+01 1.94522836e+01 8.48e-05 2.22e-16 5.19e-03 0s 5 2.00004599e+01 1.99982376e+01 3.82e-08 2.22e-16 1.63e-05 0s 6 2.00000000e+01 2.00000000e+01 4.44e-14 3.33e-16 1.68e-11 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 2.00000000e+01 Root relaxation: objective 2.000000e+01, 48 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 20.0000000 20.00000 0.0% - 0s Explored 0 nodes (48 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.000000000000e+01, best bound 2.000000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 20 Solution: 5 x [1, 2, 4, 7, 8] 8 x [1, 2, 6, 7, 8] 3 x [3, 6, 7, 8, 9] 1 x [1, 5, 5, 8, 9] 2 x [1, 3, 4, 6, 10] 1 x [1, 1, 7, 9, 10]