Build (method = -2) #dp: 1741 Step-3' Graph: 62 vertices and 174 arcs (0.01s) Step-4' Graph: 11 vertices and 72 arcs (0.01s) #V4/#V3 = 0.18 #A4/#A3 = 0.41 Ready! (0.01s) Optimize a model with 21 rows, 73 columns and 206 nonzeros Presolve removed 3 rows and 5 columns Presolve time: 0.00s Presolved: 18 rows, 68 columns, 196 nonzeros Variable types: 0 continuous, 68 integer (0 binary) Found heuristic solution: objective 998.0000000 Found heuristic solution: objective 961.0000000 Optimize a model with 18 rows, 68 columns and 196 nonzeros Presolved: 18 rows, 68 columns, 196 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 7.700e+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 4.56518554e+03 -9.39874947e+03 1.67e+03 0.00e+00 3.46e+02 0s 1 9.63985733e+02 -4.12452371e+03 8.46e+01 4.44e-16 4.44e+01 0s 2 5.02168540e+02 -2.20829795e+02 9.66e-13 1.17e-15 4.98e+00 0s 3 2.04025084e+02 2.41816498e+01 1.50e-13 3.33e-16 1.23e+00 0s 4 1.73841799e+02 1.49627870e+02 1.40e-13 3.13e-16 1.66e-01 0s 5 1.66698082e+02 1.66572435e+02 4.95e-13 2.43e-16 8.61e-04 0s 6 1.66666667e+02 1.66666667e+02 3.46e-14 1.76e-16 9.34e-10 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 1.66666667e+02 Root relaxation: objective 1.666667e+02, 54 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 166.66667 0 8 961.00000 166.66667 82.7% - 0s H 0 0 167.0000000 166.66667 0.20% - 0s Explored 0 nodes (56 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.670000000000e+02, best bound 1.670000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.02 seconds Objective: 167 Solution: 31 x [3, 5, 6, 7, 8, 10] 7 x [1, 2, 3, 4, 7, 8] 1 x [1, 6, 8, 9, 10] 2 x [2, 4, 4, 5, 10, 10] 73 x [4, 5, 5, 6, 9, 10] 34 x [1, 3, 7, 7, 9, 10] 2 x [1, 2, 4, 4, 7, 10] 16 x [1, 2, 4, 7, 7, 10] 1 x [1, 2, 4, 4, 10]