Build (method = -2) #dp: 4110 Step-3' Graph: 147 vertices and 462 arcs (0.02s) Step-4' Graph: 74 vertices and 316 arcs (0.02s) #V4/#V3 = 0.50 #A4/#A3 = 0.68 Ready! (0.02s) Optimize a model with 84 rows, 317 columns and 814 nonzeros Presolve removed 24 rows and 47 columns Presolve time: 0.00s Presolved: 60 rows, 270 columns, 743 nonzeros Variable types: 0 continuous, 270 integer (0 binary) Found heuristic solution: objective 996.0000000 Found heuristic solution: objective 543.0000000 Optimize a model with 60 rows, 270 columns and 743 nonzeros Presolved: 60 rows, 270 columns, 743 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.030e+02 Factor NZ : 1.038e+03 Factor Ops : 2.036e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.37873377e+03 -4.76827851e+04 3.48e+04 2.22e-16 5.22e+02 0s 1 2.06139543e+03 -1.73083356e+04 5.46e+03 5.00e-16 8.89e+01 0s 2 9.11964401e+02 -4.49722879e+03 4.71e+02 8.88e-16 1.31e+01 0s 3 5.20028237e+02 -1.15430959e+03 1.07e+01 4.16e-16 3.09e+00 0s 4 2.44310357e+02 -2.35936615e+02 2.49e+00 4.44e-16 8.80e-01 0s 5 1.58766342e+02 -2.89604808e+01 1.14e+00 2.22e-16 3.43e-01 0s 6 1.40743986e+02 7.33720913e+01 6.02e-01 2.57e-16 1.23e-01 0s 7 1.33292737e+02 9.29714523e+01 1.55e-01 2.22e-16 7.34e-02 0s 8 1.27326417e+02 1.20833069e+02 3.39e-02 1.64e-16 1.18e-02 0s 9 1.25023149e+02 1.24784938e+02 2.86e-04 3.33e-16 4.33e-04 0s 10 1.25000025e+02 1.24999779e+02 9.00e-14 2.00e-16 4.48e-07 0s 11 1.25000000e+02 1.25000000e+02 4.62e-14 3.33e-16 4.48e-10 0s Barrier solved model in 11 iterations and 0.00 seconds Optimal objective 1.25000000e+02 Root relaxation: objective 1.250000e+02, 173 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 13 543.00000 125.00000 77.0% - 0s H 0 0 127.0000000 125.00000 1.57% - 0s H 0 0 126.0000000 125.00000 0.79% - 0s 0 0 125.00000 0 21 126.00000 125.00000 0.79% - 0s 0 0 125.00000 0 34 126.00000 125.00000 0.79% - 0s H 0 0 125.0000000 125.00000 0.0% - 0s Cutting planes: Gomory: 1 Mod-K: 1 Explored 0 nodes (243 simplex iterations) in 0.03 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.03 seconds Total run time: 0.06 seconds Objective: 125 Solution: 16 x [1, 2, 3, 3, 6, 7, 9, 10] 1 x [1, 1, 1, 2, 3, 6, 8, 9] 55 x [1, 2, 3, 3, 6, 7, 9, 9] 5 x [1, 3, 3, 7, 9, 9, 9, 10] 2 x [1, 2, 3, 3, 6, 9, 9, 9] 1 x [2, 2, 3, 3, 6, 9, 9, 9] 1 x [1, 1, 1, 2, 3, 5, 5, 6] 32 x [1, 1, 1, 2, 3, 4, 4, 8] 12 x [1, 1, 1, 2, 6, 7, 8, 10]