Build (method = -2) #dp: 1211 Step-3' Graph: 63 vertices and 181 arcs (0.00s) Step-4' Graph: 13 vertices and 81 arcs (0.00s) #V4/#V3 = 0.21 #A4/#A3 = 0.45 Ready! (0.00s) Optimize a model with 23 rows, 82 columns and 229 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 21 rows, 80 columns, 225 nonzeros Variable types: 0 continuous, 80 integer (0 binary) Found heuristic solution: objective 880.0000000 Optimize a model with 21 rows, 80 columns and 225 nonzeros Presolved: 21 rows, 80 columns, 225 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 9.400e+01 Factor NZ : 1.910e+02 Factor Ops : 2.111e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.77937377e+03 -1.01815285e+04 2.35e+03 2.22e-16 2.76e+02 0s 1 9.62969928e+02 -4.47590517e+03 2.08e+02 5.55e-16 4.46e+01 0s 2 4.33512581e+02 -3.20039013e+02 1.99e-13 3.89e-16 4.46e+00 0s 3 2.14258802e+02 2.36760865e+01 1.29e-13 2.29e-16 1.12e+00 0s 4 1.74805934e+02 1.44089588e+02 1.64e-13 3.33e-16 1.81e-01 0s 5 1.66802573e+02 1.66125222e+02 1.24e-13 3.13e-16 3.98e-03 0s 6 1.66666668e+02 1.66666651e+02 1.50e-13 2.83e-16 9.91e-08 0s 7 1.66666667e+02 1.66666667e+02 2.03e-13 2.22e-16 1.02e-13 0s Barrier solved model in 7 iterations and 0.00 seconds Optimal objective 1.66666667e+02 Root relaxation: objective 1.666667e+02, 59 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 9 880.00000 166.66667 81.1% - 0s H 0 0 167.0000000 166.66667 0.20% - 0s Explored 0 nodes (67 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.01 seconds Objective: 167 Solution: 49 x [2, 3, 4, 6, 7, 9] 71 x [3, 5, 5, 7, 9, 10] 4 x [2, 3, 3, 4, 7, 7] 3 x [2, 3, 5, 6, 7, 10] 9 x [2, 3, 6, 7, 8, 10] 30 x [1, 3, 5, 5, 7, 10] 1 x [3, 5, 7, 8]