Build (method = -2) #dp: 916 Step-3' Graph: 58 vertices and 163 arcs (0.00s) Step-4' Graph: 13 vertices and 73 arcs (0.00s) #V4/#V3 = 0.22 #A4/#A3 = 0.45 Ready! (0.00s) Optimize a model with 23 rows, 74 columns and 204 nonzeros Presolve removed 6 rows and 10 columns Presolve time: 0.00s Presolved: 17 rows, 64 columns, 186 nonzeros Variable types: 0 continuous, 64 integer (0 binary) Found heuristic solution: objective 99.0000000 Found heuristic solution: objective 79.0000000 Optimize a model with 17 rows, 64 columns and 186 nonzeros Presolved: 17 rows, 64 columns, 186 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 6.900e+01 Factor NZ : 1.530e+02 Factor Ops : 1.785e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.77300141e+02 -5.99153412e+02 1.02e+02 2.22e-16 1.83e+01 0s 1 6.72588993e+01 -2.33650429e+02 1.11e+00 5.55e-16 2.32e+00 0s 2 3.97816768e+01 -3.33847168e+01 9.04e-03 5.55e-16 5.37e-01 0s 3 2.07113195e+01 1.35104245e+01 3.09e-04 2.64e-16 5.22e-02 0s 4 2.01166480e+01 1.99379316e+01 1.67e-14 2.22e-16 1.30e-03 0s 5 2.00000209e+01 1.99999560e+01 1.86e-14 2.26e-16 4.70e-07 0s 6 2.00000000e+01 2.00000000e+01 2.48e-14 2.64e-16 1.30e-12 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 2.00000000e+01 Root relaxation: objective 2.000000e+01, 53 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 (53 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: 9 x [1, 4, 6, 7, 8] 2 x [6, 7, 7, 8, 9] 5 x [2, 4, 8, 10, 10] 3 x [3, 5, 8, 9, 10] 1 x [3, 5, 6, 10, 10]