Build (method = -2) #dp: 3362 Step-3' Graph: 219 vertices and 949 arcs (0.02s) Step-4' Graph: 171 vertices and 853 arcs (0.02s) #V4/#V3 = 0.78 #A4/#A3 = 0.90 Ready! (0.02s) Optimize a model with 181 rows, 854 columns and 2231 nonzeros Presolve removed 20 rows and 40 columns Presolve time: 0.01s Presolved: 161 rows, 814 columns, 2165 nonzeros Variable types: 0 continuous, 814 integer (0 binary) Found heuristic solution: objective 693.0000000 Optimize a model with 161 rows, 814 columns and 2165 nonzeros Presolved: 161 rows, 814 columns, 2165 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.241e+03 Factor NZ : 3.886e+03 Factor Ops : 1.045e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 8.33646203e+03 -1.32995925e+05 1.18e+05 2.22e-16 5.20e+02 0s 1 2.57306634e+03 -6.20920089e+04 2.12e+04 5.55e-16 1.04e+02 0s 2 1.50688806e+03 -2.34103207e+04 5.46e+03 5.55e-16 2.82e+01 0s 3 1.02952065e+03 -4.93043842e+03 4.73e+02 3.77e-15 4.43e+00 0s 4 9.23723560e+02 -1.64411343e+03 1.64e-01 1.33e-15 1.57e+00 0s 5 7.53523129e+02 -9.38026062e+02 1.17e-01 5.55e-16 1.03e+00 0s 6 5.72759085e+02 -4.39218158e+02 5.74e-02 2.53e-16 6.18e-01 0s 7 3.52358184e+02 -2.56030911e+02 3.02e-02 1.87e-16 3.71e-01 0s 8 2.44936592e+02 -1.61175771e+02 2.02e-02 2.22e-16 2.48e-01 0s 9 1.73544126e+02 -2.40059544e+01 1.20e-02 2.49e-16 1.21e-01 0s 10 1.45042153e+02 4.41066121e+01 7.97e-03 2.29e-16 6.16e-02 0s 11 1.34459814e+02 1.10288714e+02 1.86e-03 2.87e-16 1.48e-02 0s 12 1.25257768e+02 1.23698149e+02 3.77e-05 2.01e-16 9.52e-04 0s 13 1.25000191e+02 1.24999563e+02 4.98e-12 2.42e-16 3.84e-07 0s 14 1.25000000e+02 1.25000000e+02 2.91e-12 2.22e-16 9.28e-13 0s Barrier solved model in 14 iterations and 0.01 seconds Optimal objective 1.25000000e+02 Root relaxation: objective 1.250000e+02, 490 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 19 693.00000 125.00000 82.0% - 0s H 0 0 126.0000000 125.00000 0.79% - 0s * 0 0 0 125.0000000 125.00000 0.0% - 0s Cutting planes: Gomory: 1 MIR: 1 Explored 0 nodes (1530 simplex iterations) in 0.10 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.10 seconds Total run time: 0.12 seconds Objective: 125 Solution: 1 x [2, 2, 3, 5, 6, 8, 9, 10] 32 x [2, 3, 4, 6, 7, 8, 9, 10] 35 x [2, 3, 4, 6, 7, 8, 10, 10] 9 x [1, 1, 2, 2, 3, 6, 8, 9] 28 x [1, 1, 5, 5, 5, 6, 8, 9] 2 x [4, 5, 5, 5, 6, 6, 8, 9] 2 x [1, 1, 3, 3, 3, 6, 7, 7] 1 x [1, 1, 3, 3, 3, 4, 5, 8] 15 x [1, 1, 3, 3, 3, 7, 7, 7]