Build (method = -2) #dp: 1896 Step-3' Graph: 77 vertices and 237 arcs (0.01s) Step-4' Graph: 35 vertices and 153 arcs (0.01s) #V4/#V3 = 0.45 #A4/#A3 = 0.65 Ready! (0.01s) Optimize a model with 45 rows, 154 columns and 401 nonzeros Presolve removed 9 rows and 16 columns Presolve time: 0.00s Presolved: 36 rows, 138 columns, 372 nonzeros Variable types: 0 continuous, 138 integer (0 binary) Found heuristic solution: objective 98.0000000 Found heuristic solution: objective 56.0000000 Optimize a model with 36 rows, 138 columns and 372 nonzeros Presolved: 36 rows, 138 columns, 372 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.970e+02 Factor NZ : 4.810e+02 Factor Ops : 7.591e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.75453865e+02 -1.82897329e+03 1.10e+03 1.11e-16 3.74e+01 0s 1 1.43345995e+02 -7.90621793e+02 1.19e+02 8.88e-16 5.68e+00 0s 2 7.06801856e+01 -1.41566488e+02 4.90e+00 8.33e-16 7.84e-01 0s 3 3.10235218e+01 -1.58289323e+01 4.41e-01 8.88e-16 1.65e-01 0s 4 1.92026361e+01 2.30189011e+00 9.09e-02 1.15e-15 5.93e-02 0s 5 1.69596751e+01 1.51145690e+01 4.95e-03 8.07e-16 6.46e-03 0s 6 1.66681286e+01 1.66598157e+01 3.39e-06 1.12e-15 2.91e-05 0s 7 1.66666667e+01 1.66666667e+01 3.49e-12 9.87e-16 4.01e-11 0s Barrier solved model in 7 iterations and 0.00 seconds Optimal objective 1.66666667e+01 Root relaxation: objective 1.666667e+01, 88 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 16.66667 0 9 56.00000 16.66667 70.2% - 0s H 0 0 17.0000000 16.66667 1.96% - 0s Explored 0 nodes (144 simplex iterations) in 0.01 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.700000000000e+01, best bound 1.700000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.01 seconds Total run time: 0.02 seconds Objective: 17 Solution: 3 x [1, 3, 5, 6, 8, 9] 1 x [3, 4, 6, 7, 8, 9] 1 x [4, 4, 4, 5, 6, 8] 5 x [1, 5, 6, 7, 8, 10] 1 x [4, 5, 5, 6, 6, 8] 1 x [5, 6, 8, 8] 5 x [2, 3, 4, 7, 9, 9]