Build (method = -2) #dp: 1730 Step-3' Graph: 67 vertices and 194 arcs (0.01s) Step-4' Graph: 20 vertices and 100 arcs (0.01s) #V4/#V3 = 0.30 #A4/#A3 = 0.52 Ready! (0.01s) Optimize a model with 30 rows, 101 columns and 272 nonzeros Presolve removed 5 rows and 9 columns Presolve time: 0.00s Presolved: 25 rows, 92 columns, 254 nonzeros Variable types: 0 continuous, 92 integer (0 binary) Found heuristic solution: objective 962.0000000 Found heuristic solution: objective 795.0000000 Optimize a model with 25 rows, 92 columns and 254 nonzeros Presolved: 25 rows, 92 columns, 254 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.190e+02 Factor NZ : 2.590e+02 Factor Ops : 3.281e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.14082004e+03 -1.31077279e+04 4.70e+03 2.22e-16 3.77e+02 0s 1 1.41140917e+03 -6.06124880e+03 5.57e+02 4.44e-16 6.32e+01 0s 2 5.78614855e+02 -1.01624275e+03 1.14e-13 4.44e-16 8.23e+00 0s 3 2.37276997e+02 -1.93597505e+01 2.13e-13 2.22e-16 1.32e+00 0s 4 1.84758641e+02 1.29800417e+02 6.93e-14 1.63e-16 2.83e-01 0s 5 1.68401408e+02 1.62407851e+02 1.11e-13 1.11e-16 3.09e-02 0s 6 1.66667808e+02 1.66660928e+02 1.89e-13 1.11e-16 3.55e-05 0s 7 1.66666667e+02 1.66666667e+02 4.31e-14 2.22e-16 3.63e-11 0s Barrier solved model in 7 iterations and 0.00 seconds Optimal objective 1.66666667e+02 Root relaxation: objective 1.666667e+02, 64 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 14 795.00000 166.66667 79.0% - 0s H 0 0 167.0000000 166.66667 0.20% - 0s Explored 0 nodes (75 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: 20 x [1, 2, 4, 5, 7, 10] 16 x [2, 4, 5, 7, 9, 10] 1 x [2, 7, 9, 10, 10] 1 x [1, 2, 3, 4, 8] 60 x [1, 2, 3, 3, 4, 8] 1 x [2, 6, 8, 9, 10, 10] 7 x [1, 5, 6, 8, 8, 10] 2 x [1, 6, 8, 8, 10, 10] 2 x [1, 1, 6, 8, 8, 10] 57 x [1, 5, 6, 9, 10, 10]