Build (method = -2) #dp: 577 Step-3' Graph: 53 vertices and 148 arcs (0.00s) Step-4' Graph: 13 vertices and 68 arcs (0.00s) #V4/#V3 = 0.25 #A4/#A3 = 0.46 Ready! (0.00s) Optimize a model with 22 rows, 69 columns and 189 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 20 rows, 67 columns, 185 nonzeros Variable types: 0 continuous, 67 integer (0 binary) Found heuristic solution: objective 999.0000000 Found heuristic solution: objective 872.0000000 Optimize a model with 20 rows, 67 columns and 185 nonzeros Presolved: 20 rows, 67 columns, 185 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 8.000e+01 Factor NZ : 1.660e+02 Factor Ops : 1.726e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.68775494e+03 -5.17903412e+03 1.98e+03 2.22e-16 1.78e+02 0s 1 7.30067889e+02 -2.03357944e+03 1.13e+02 4.44e-16 2.50e+01 0s 2 3.46902841e+02 -3.78027110e+00 3.15e+00 1.67e-15 2.53e+00 0s 3 2.09672569e+02 1.55379607e+02 1.57e-01 3.33e-16 3.80e-01 0s 4 2.00469226e+02 1.97297086e+02 6.13e-06 3.33e-16 2.22e-02 0s 5 2.00036627e+02 1.99875973e+02 1.54e-06 2.22e-16 1.12e-03 0s 6 2.00000003e+02 1.99999976e+02 1.25e-13 1.67e-16 1.94e-07 0s 7 2.00000000e+02 2.00000000e+02 4.50e-14 2.22e-16 1.98e-13 0s Barrier solved model in 7 iterations and 0.00 seconds Optimal objective 2.00000000e+02 Root relaxation: objective 2.000000e+02, 50 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 200.0000000 200.00000 0.0% - 0s Explored 0 nodes (50 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+02, best bound 2.000000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 200 Solution: 1 x [4, 6, 7, 7, 9] 2 x [2, 7, 7, 8, 9] 36 x [1, 4, 5, 5, 9] 70 x [1, 3, 4, 7, 9] 19 x [1, 5, 7, 8, 9] 1 x [3, 6, 7, 7, 8] 8 x [3, 4, 5, 7, 7] 63 x [3, 5, 7, 8, 8]