Build (method = -2) #dp: 1439 Step-3' Graph: 68 vertices and 194 arcs (0.01s) Step-4' Graph: 18 vertices and 94 arcs (0.01s) #V4/#V3 = 0.26 #A4/#A3 = 0.48 Ready! (0.01s) Optimize a model with 28 rows, 95 columns and 258 nonzeros Presolve removed 7 rows and 13 columns Presolve time: 0.00s Presolved: 21 rows, 82 columns, 233 nonzeros Variable types: 0 continuous, 82 integer (0 binary) Found heuristic solution: objective 999.0000000 Found heuristic solution: objective 875.0000000 Optimize a model with 21 rows, 82 columns and 233 nonzeros Presolved: 21 rows, 82 columns, 233 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 9.800e+01 Factor NZ : 2.310e+02 Factor Ops : 3.311e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.49681646e+03 -1.13209803e+04 3.39e+03 1.11e-16 4.03e+02 0s 1 1.34857012e+03 -4.99965052e+03 3.67e+02 6.66e-16 6.13e+01 0s 2 5.31350660e+02 -6.20370113e+02 3.31e-01 9.99e-16 6.63e+00 0s 3 2.10717321e+02 3.00879824e+01 5.77e-02 3.33e-16 1.04e+00 0s 4 1.85311385e+02 1.39316422e+02 9.65e-03 2.22e-16 2.64e-01 0s 5 1.67272601e+02 1.63693890e+02 2.63e-04 2.22e-16 2.06e-02 0s 6 1.66667295e+02 1.66664546e+02 2.14e-07 1.52e-16 1.58e-05 0s 7 1.66666667e+02 1.66666667e+02 2.90e-13 3.33e-16 1.66e-11 0s Barrier solved model in 7 iterations and 0.00 seconds Optimal objective 1.66666667e+02 Root relaxation: objective 1.666667e+02, 60 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 11 875.00000 166.66667 81.0% - 0s H 0 0 167.0000000 166.66667 0.20% - 0s Explored 0 nodes (73 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: 58 x [1, 2, 4, 5, 6, 10] 72 x [1, 2, 3, 4, 8, 9] 1 x [4, 6, 8, 10] 11 x [2, 2, 3, 4, 6, 6] 2 x [4, 6, 6, 8, 10, 10] 5 x [4, 6, 6, 7, 10, 10] 18 x [3, 5, 6, 6, 6, 10]