Build (method = -2) #dp: 4942 Step-3' Graph: 133 vertices and 423 arcs (0.02s) Step-4' Graph: 63 vertices and 283 arcs (0.02s) #V4/#V3 = 0.47 #A4/#A3 = 0.67 Ready! (0.02s) Optimize a model with 73 rows, 284 columns and 737 nonzeros Presolve removed 10 rows and 20 columns Presolve time: 0.00s Presolved: 63 rows, 264 columns, 704 nonzeros Variable types: 0 continuous, 264 integer (0 binary) Found heuristic solution: objective 831.0000000 Found heuristic solution: objective 454.0000000 Optimize a model with 63 rows, 264 columns and 704 nonzeros Presolved: 63 rows, 264 columns, 704 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.860e+02 Factor NZ : 1.074e+03 Factor Ops : 2.081e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.33494799e+03 -4.59156941e+04 3.21e+04 1.11e-16 4.63e+02 0s 1 1.62770014e+03 -1.90038910e+04 4.55e+03 5.55e-16 8.03e+01 0s 2 8.70735912e+02 -5.39079800e+03 7.69e+02 7.22e-16 1.67e+01 0s 3 5.64398129e+02 -5.95788051e+02 2.81e-13 5.55e-16 2.16e+00 0s 4 2.74009336e+02 -1.19098495e+02 1.31e-13 2.84e-16 7.31e-01 0s 5 1.96896518e+02 -1.15169768e+01 1.97e-13 2.88e-16 3.87e-01 0s 6 1.85796854e+02 6.12740287e+00 1.32e-13 3.31e-16 3.34e-01 0s 7 1.48851930e+02 7.13645518e+01 2.18e-13 2.66e-16 1.44e-01 0s 8 1.34836131e+02 1.17558645e+02 2.56e-13 2.06e-16 3.21e-02 0s 9 1.25504144e+02 1.24341699e+02 3.09e-13 2.15e-16 2.16e-03 0s 10 1.25000509e+02 1.24999341e+02 3.31e-13 2.46e-16 2.17e-06 0s 11 1.25000001e+02 1.24999999e+02 3.69e-13 2.74e-16 2.17e-09 0s Barrier solved model in 11 iterations and 0.00 seconds Optimal objective 1.25000001e+02 Root relaxation: objective 1.250000e+02, 154 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 125.00000 0 16 454.00000 125.00000 72.5% - 0s H 0 0 126.0000000 125.00000 0.79% - 0s H 0 0 125.0000000 125.00000 0.0% - 0s Explored 0 nodes (218 simplex iterations) in 0.01 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.250000000000e+02, best bound 1.250000000000e+02, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.01 seconds Total run time: 0.04 seconds Objective: 125 Solution: 1 x [2, 3, 4, 5, 6, 7, 8, 10] 27 x [2, 3, 3, 4, 7, 8, 9, 10] 9 x [1, 2, 3, 4, 10, 10, 10, 10] 46 x [1, 1, 2, 2, 3, 4, 6, 6] 1 x [1, 3, 4, 5, 6, 6, 6, 10] 1 x [1, 3, 3, 4, 6, 6, 10, 10] 30 x [1, 2, 3, 4, 4, 5, 6, 6] 7 x [1, 2, 3, 4, 4, 7, 8, 10] 2 x [1, 1, 2, 3, 3, 4, 4, 10] 1 x [1, 1, 2, 3, 3, 4, 4, 7]