Build (method = -2) #dp: 1787 Step-3' Graph: 65 vertices and 184 arcs (0.01s) Step-4' Graph: 15 vertices and 84 arcs (0.01s) #V4/#V3 = 0.23 #A4/#A3 = 0.46 Ready! (0.01s) Optimize a model with 25 rows, 85 columns and 234 nonzeros Presolve removed 3 rows and 4 columns Presolve time: 0.00s Presolved: 22 rows, 81 columns, 226 nonzeros Variable types: 0 continuous, 81 integer (0 binary) Found heuristic solution: objective 98.0000000 Found heuristic solution: objective 88.0000000 Optimize a model with 22 rows, 81 columns and 226 nonzeros Presolved: 22 rows, 81 columns, 226 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 9.800e+01 Factor NZ : 2.050e+02 Factor Ops : 2.403e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.43877195e+02 -7.72721003e+02 2.15e+02 2.22e-16 2.30e+01 0s 1 8.05779474e+01 -3.55179374e+02 1.04e+01 3.33e-16 3.17e+00 0s 2 4.44270831e+01 -1.95125444e+01 1.35e-02 5.55e-16 3.75e-01 0s 3 1.86856275e+01 8.02277983e+00 1.54e-03 2.78e-16 6.20e-02 0s 4 1.69848371e+01 1.57611654e+01 2.23e-04 2.43e-16 7.11e-03 0s 5 1.66710139e+01 1.66535890e+01 2.29e-08 3.10e-16 1.01e-04 0s 6 1.66666667e+01 1.66666664e+01 1.08e-12 2.23e-16 1.53e-09 0s 7 1.66666667e+01 1.66666667e+01 2.22e-14 4.44e-16 3.52e-15 0s Barrier solved model in 7 iterations and 0.00 seconds Optimal objective 1.66666667e+01 Root relaxation: objective 1.666667e+01, 61 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 8 88.00000 16.66667 81.1% - 0s H 0 0 17.0000000 16.66667 1.96% - 0s Explored 0 nodes (72 simplex iterations) in 0.00 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.00 seconds Total run time: 0.02 seconds Objective: 17 Solution: 7 x [1, 3, 4, 8, 9, 10] 5 x [2, 5, 6, 8, 9, 10] 1 x [2, 3, 4, 8, 10] 1 x [2, 4, 5, 8, 8] 1 x [1, 3, 4, 4, 10, 10] 2 x [1, 3, 6, 7, 10, 10]