Build (method = -2) #dp: 3376 Step-3' Graph: 162 vertices and 527 arcs (0.01s) Step-4' Graph: 100 vertices and 403 arcs (0.02s) #V4/#V3 = 0.62 #A4/#A3 = 0.76 Ready! (0.02s) Optimize a model with 110 rows, 404 columns and 1023 nonzeros Presolve removed 29 rows and 56 columns Presolve time: 0.00s Presolved: 81 rows, 348 columns, 937 nonzeros Variable types: 0 continuous, 348 integer (0 binary) Found heuristic solution: objective 963.0000000 Found heuristic solution: objective 906.0000000 Optimize a model with 81 rows, 348 columns and 937 nonzeros Presolved: 81 rows, 348 columns, 937 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.270e+02 Factor NZ : 1.673e+03 Factor Ops : 3.949e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.42534738e+03 -5.30226438e+04 3.83e+04 2.22e-16 4.06e+02 0s 1 2.01899790e+03 -2.14502753e+04 6.79e+03 6.66e-16 7.87e+01 0s 2 1.00716136e+03 -6.01502095e+03 9.01e+02 6.66e-16 1.40e+01 0s 3 6.17133549e+02 -9.83002006e+02 6.27e+00 6.66e-16 2.28e+00 0s 4 3.64314714e+02 -3.82487093e+02 3.02e+00 2.46e-16 1.06e+00 0s 5 2.75934467e+02 -1.39111120e+02 2.01e+00 2.19e-16 5.91e-01 0s 6 1.53820540e+02 -8.30886072e+00 6.85e-01 2.28e-16 2.31e-01 0s 7 1.48806884e+02 2.08428929e+01 5.77e-01 1.39e-16 1.82e-01 0s 8 1.39351305e+02 9.46358853e+01 3.70e-01 3.33e-16 6.37e-02 0s 9 1.30917854e+02 1.20164243e+02 1.56e-01 2.32e-16 1.53e-02 0s 10 1.25046462e+02 1.24811903e+02 4.08e-13 2.22e-16 3.32e-04 0s 11 1.25000046e+02 1.24999812e+02 3.32e-13 2.39e-16 3.32e-07 0s 12 1.25000000e+02 1.25000000e+02 4.13e-13 1.59e-16 3.32e-10 0s Barrier solved model in 12 iterations and 0.00 seconds Optimal objective 1.25000000e+02 Root relaxation: objective 1.250000e+02, 211 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 125.00000 0 38 906.00000 125.00000 86.2% - 0s H 0 0 126.0000000 125.00000 0.79% - 0s 0 0 125.00000 0 30 126.00000 125.00000 0.79% - 0s * 0 0 0 125.0000000 125.00000 0.0% - 0s Explored 0 nodes (722 simplex iterations) in 0.05 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.02 seconds Gurobi run time: 0.05 seconds Total run time: 0.07 seconds Objective: 125 Solution: 1 x [1, 2, 2, 5, 7, 8, 9, 10] 7 x [1, 2, 2, 5, 6, 9, 9, 10] 1 x [1, 2, 2, 5, 7, 7, 8, 10] 29 x [1, 3, 5, 5, 6, 9, 9, 10] 56 x [1, 2, 3, 5, 6, 7, 8, 9] 11 x [2, 2, 5, 7, 7, 9, 9, 10] 5 x [3, 5, 6, 10, 10, 10, 10, 10] 9 x [2, 2, 2, 3, 4, 5, 7, 9] 6 x [2, 2, 2, 3, 4, 5, 5, 6]