Build (method = -2) #dp: 4991 Step-3' Graph: 163 vertices and 580 arcs (0.02s) Step-4' Graph: 105 vertices and 464 arcs (0.02s) #V4/#V3 = 0.64 #A4/#A3 = 0.80 Ready! (0.02s) Optimize a model with 115 rows, 465 columns and 1196 nonzeros Presolve removed 25 rows and 49 columns Presolve time: 0.00s Presolved: 90 rows, 416 columns, 1105 nonzeros Variable types: 0 continuous, 416 integer (0 binary) Found heuristic solution: objective 88.0000000 Found heuristic solution: objective 66.0000000 Optimize a model with 90 rows, 416 columns and 1105 nonzeros Presolved: 90 rows, 416 columns, 1105 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 6.020e+02 Factor NZ : 1.830e+03 Factor Ops : 4.215e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.15298666e+02 -5.10333874e+03 5.41e+03 2.22e-16 3.86e+01 0s 1 2.33068085e+02 -2.23320034e+03 1.03e+03 5.55e-16 7.88e+00 0s 2 1.04514015e+02 -7.86754881e+02 1.25e+02 1.22e-15 1.51e+00 0s 3 7.33513016e+01 -1.58715340e+02 1.69e-14 5.27e-16 2.76e-01 0s 4 5.14381368e+01 -4.94187829e+01 2.17e-14 2.53e-16 1.20e-01 0s 5 2.85270634e+01 -2.42825523e+01 1.08e-14 3.33e-16 6.27e-02 0s 6 1.67318829e+01 -2.64681851e-01 5.46e-14 2.46e-16 2.02e-02 0s 7 1.43772023e+01 4.64103957e+00 3.02e-14 2.86e-16 1.16e-02 0s 8 1.31830455e+01 1.08598477e+01 8.90e-14 3.33e-16 2.76e-03 0s 9 1.25059313e+01 1.24862137e+01 3.33e-14 3.33e-16 2.34e-05 0s 10 1.25000059e+01 1.24999862e+01 6.08e-14 3.33e-16 2.34e-08 0s 11 1.25000000e+01 1.25000000e+01 1.91e-14 2.39e-16 2.35e-14 0s Barrier solved model in 11 iterations and 0.00 seconds Optimal objective 1.25000000e+01 Root relaxation: objective 1.250000e+01, 241 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 12.50000 0 32 66.00000 12.50000 81.1% - 0s H 0 0 17.0000000 12.50000 26.5% - 0s H 0 0 14.0000000 12.50000 10.7% - 0s 0 0 12.50000 0 43 14.00000 12.50000 10.7% - 0s H 0 0 13.0000000 12.50000 3.85% - 0s Cutting planes: Gomory: 1 Explored 0 nodes (369 simplex iterations) in 0.04 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.300000000000e+01, best bound 1.300000000000e+01, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.04 seconds Total run time: 0.07 seconds Objective: 13 Solution: 3 x [1, 4, 7, 9, 10, 10, 10, 10] 1 x [1, 2, 3, 5, 6, 6] 2 x [1, 2, 2, 2, 2, 6, 6, 10] 1 x [1, 3, 4, 5, 6, 6, 6, 9] 1 x [1, 1, 2, 6, 6, 9, 9] 2 x [1, 1, 1, 2, 2, 2, 6, 6] 1 x [1, 1, 1, 3, 5, 5, 5, 6] 1 x [4, 6, 6, 8, 8, 8, 9] 1 x [4, 6, 6, 8, 8, 8, 8, 9]