Build (method = -2) #dp: 1809 Step-3' Graph: 68 vertices and 200 arcs (0.01s) Step-4' Graph: 25 vertices and 114 arcs (0.01s) #V4/#V3 = 0.37 #A4/#A3 = 0.57 Ready! (0.01s) Optimize a model with 35 rows, 115 columns and 304 nonzeros Presolve removed 7 rows and 12 columns Presolve time: 0.00s Presolved: 28 rows, 103 columns, 282 nonzeros Variable types: 0 continuous, 103 integer (0 binary) Found heuristic solution: objective 999.0000000 Found heuristic solution: objective 737.0000000 Optimize a model with 28 rows, 103 columns and 282 nonzeros Presolved: 28 rows, 103 columns, 282 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.370e+02 Factor NZ : 3.290e+02 Factor Ops : 4.711e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.90627649e+03 -1.89999613e+04 8.34e+03 2.22e-16 5.12e+02 0s 1 1.65049165e+03 -7.47316701e+03 8.56e+02 4.44e-16 7.17e+01 0s 2 6.77898333e+02 -1.45826770e+03 2.96e-02 5.55e-16 9.89e+00 0s 3 3.28657891e+02 -5.80151192e+01 1.42e-13 3.05e-16 1.79e+00 0s 4 2.02379906e+02 7.29994270e+01 1.08e-13 3.12e-16 5.99e-01 0s 5 1.79302893e+02 1.48079574e+02 9.67e-14 2.72e-16 1.45e-01 0s 6 1.66792639e+02 1.66400091e+02 8.68e-14 2.22e-16 1.82e-03 0s 7 1.66666667e+02 1.66666666e+02 3.44e-13 2.49e-16 7.40e-09 0s Barrier solved model in 7 iterations and 0.00 seconds Optimal objective 1.66666667e+02 Root relaxation: objective 1.666667e+02, 65 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 737.00000 166.66667 77.4% - 0s H 0 0 167.0000000 166.66667 0.20% - 0s Explored 0 nodes (80 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: 66 x [1, 3, 4, 6, 7, 8] 1 x [5, 6, 8, 9, 10] 8 x [5, 6, 8, 8, 9, 10] 23 x [3, 8, 8, 9, 10, 10] 1 x [1, 2, 4, 5, 6] 48 x [1, 2, 2, 2, 9, 9] 14 x [1, 3, 4, 5, 6, 7] 4 x [1, 3, 4, 6, 7, 7] 2 x [1, 3, 7, 9, 9, 9]