Build (method = -2) #dp: 4010 Step-3' Graph: 207 vertices and 789 arcs (0.02s) Step-4' Graph: 155 vertices and 685 arcs (0.02s) #V4/#V3 = 0.75 #A4/#A3 = 0.87 Ready! (0.02s) Optimize a model with 165 rows, 686 columns and 1759 nonzeros Presolve removed 33 rows and 64 columns Presolve time: 0.01s Presolved: 132 rows, 622 columns, 1666 nonzeros Variable types: 0 continuous, 622 integer (10 binary) Found heuristic solution: objective 570.0000000 Optimize a model with 132 rows, 622 columns and 1666 nonzeros Presolved: 132 rows, 622 columns, 1666 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 9.590e+02 Factor NZ : 3.146e+03 Factor Ops : 8.863e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.60933990e+03 -4.63992964e+04 7.19e+04 1.09e-01 3.86e+02 0s 1 1.90781272e+03 -2.53122400e+04 1.22e+04 5.55e-16 7.37e+01 0s 2 8.75284433e+02 -7.92912233e+03 1.74e+03 8.88e-16 1.29e+01 0s 3 6.07533003e+02 -1.37919140e+03 4.71e+01 4.44e-16 1.68e+00 0s 4 4.61838840e+02 -4.24780661e+02 3.20e+01 4.44e-16 7.48e-01 0s 5 2.66824769e+02 -9.19111299e+01 1.36e+01 2.71e-16 3.00e-01 0s 6 1.84812947e+02 1.25181306e+01 6.52e+00 3.33e-16 1.43e-01 0s 7 1.59072432e+02 5.87858965e+01 3.07e+00 3.04e-16 8.23e-02 0s 8 1.56301608e+02 7.93042173e+01 2.83e+00 3.31e-16 6.34e-02 0s 9 1.41721755e+02 1.01667286e+02 1.61e+00 2.52e-16 3.29e-02 0s 10 1.28825170e+02 1.15373947e+02 5.17e-01 3.33e-16 1.10e-02 0s 11 1.29659776e+02 1.21814090e+02 3.83e-01 2.75e-16 6.41e-03 0s 12 1.25172398e+02 1.24472995e+02 4.04e-13 2.70e-16 5.58e-04 0s 13 1.25000321e+02 1.24996680e+02 1.07e-13 2.22e-16 2.91e-06 0s 14 1.25000000e+02 1.25000000e+02 1.20e-13 3.33e-16 3.64e-12 0s Barrier solved model in 14 iterations and 0.01 seconds Optimal objective 1.25000000e+02 Root relaxation: objective 1.250000e+02, 404 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 9 570.00000 125.00000 78.1% - 0s H 0 0 126.0000000 125.00000 0.79% - 0s H 0 0 125.0000000 125.00000 0.0% - 0s Explored 0 nodes (617 simplex iterations) in 0.04 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.04 seconds Total run time: 0.07 seconds Objective: 125 Solution: 23 x [1, 3, 7, 8, 9, 9, 9, 9] 2 x [1, 3, 5, 5, 6, 6, 6, 7] 19 x [1, 1, 3, 4, 4, 5, 7, 7] 1 x [1, 1, 2, 3, 7, 8, 8, 8] 1 x [3, 5, 5, 5, 6, 6, 7, 10] 17 x [1, 3, 3, 4, 4, 7, 7, 8] 42 x [3, 3, 4, 4, 7, 7, 8, 8] 1 x [3, 3, 3, 4, 5, 6, 7, 10] 2 x [1, 1, 4, 5, 7, 8, 9, 10] 4 x [1, 1, 4, 4, 5, 7, 9, 10] 13 x [1, 1, 4, 7, 7, 8, 9, 10]