Build (method = -2) #dp: 1625 Step-3' Graph: 65 vertices and 192 arcs (0.01s) Step-4' Graph: 23 vertices and 108 arcs (0.01s) #V4/#V3 = 0.35 #A4/#A3 = 0.56 Ready! (0.01s) Optimize a model with 33 rows, 109 columns and 290 nonzeros Presolve removed 7 rows and 13 columns Presolve time: 0.00s Presolved: 26 rows, 96 columns, 265 nonzeros Variable types: 0 continuous, 96 integer (0 binary) Found heuristic solution: objective 997.0000000 Found heuristic solution: objective 683.0000000 Optimize a model with 26 rows, 96 columns and 265 nonzeros Presolved: 26 rows, 96 columns, 265 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.250e+02 Factor NZ : 2.990e+02 Factor Ops : 4.329e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.78043263e+03 -1.33455768e+04 5.49e+03 1.11e-16 4.17e+02 0s 1 1.29977936e+03 -5.78169897e+03 4.63e+02 5.55e-16 5.57e+01 0s 2 5.31060047e+02 -8.43873596e+02 8.81e-13 4.22e-15 6.81e+00 0s 3 2.53468496e+02 -7.67763803e+01 2.10e-13 6.66e-16 1.63e+00 0s 4 1.83906699e+02 6.90293540e+01 6.04e-14 2.22e-16 5.69e-01 0s 5 1.70041956e+02 1.61034058e+02 4.40e-13 2.17e-16 4.46e-02 0s 6 1.66685946e+02 1.66616651e+02 1.87e-13 2.83e-16 3.43e-04 0s 7 1.66666667e+02 1.66666667e+02 3.14e-13 1.96e-16 4.95e-10 0s Barrier solved model in 7 iterations and 0.00 seconds Optimal objective 1.66666667e+02 Root relaxation: objective 1.666667e+02, 67 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 683.00000 166.66667 75.6% - 0s H 0 0 167.0000000 166.66667 0.20% - 0s Explored 0 nodes (69 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: 1 x [2, 3, 4, 6, 8] 2 x [3, 4, 6, 8, 10, 10] 4 x [4, 6, 8, 9, 10, 10] 11 x [2, 5, 6, 8, 9, 10] 1 x [2, 6, 8, 9, 10] 15 x [1, 3, 6, 8, 10, 10] 52 x [3, 4, 6, 9, 10, 10] 81 x [3, 3, 5, 5, 7, 10]