Build (method = -2) #dp: 2780 Step-3' Graph: 195 vertices and 735 arcs (0.01s) Step-4' Graph: 140 vertices and 625 arcs (0.01s) #V4/#V3 = 0.72 #A4/#A3 = 0.85 Ready! (0.01s) Optimize a model with 149 rows, 626 columns and 1609 nonzeros Presolve removed 23 rows and 45 columns Presolve time: 0.01s Presolved: 126 rows, 581 columns, 1536 nonzeros Variable types: 0 continuous, 581 integer (0 binary) Found heuristic solution: objective 773.0000000 Found heuristic solution: objective 659.0000000 Optimize a model with 126 rows, 581 columns and 1536 nonzeros Presolved: 126 rows, 581 columns, 1536 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 8.970e+02 Factor NZ : 2.893e+03 Factor Ops : 7.649e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.08211175e+03 -9.71492314e+04 8.81e+04 2.22e-16 5.27e+02 0s 1 2.10199565e+03 -4.76076906e+04 1.28e+04 7.77e-16 9.52e+01 0s 2 1.32492961e+03 -1.61490704e+04 3.15e+03 5.55e-16 2.48e+01 0s 3 9.68728764e+02 -2.30528207e+03 7.16e+01 1.33e-15 2.93e+00 0s 4 5.67296324e+02 -7.92121875e+02 3.41e-02 8.88e-16 1.16e+00 0s 5 3.92318837e+02 -4.20294672e+02 2.22e-02 4.44e-16 6.94e-01 0s 6 2.99277824e+02 -1.94579330e+02 1.62e-02 3.33e-16 4.22e-01 0s 7 2.21892783e+02 -5.76914060e+01 1.08e-02 1.91e-16 2.39e-01 0s 8 1.62954579e+02 1.66307098e+01 5.14e-03 3.13e-16 1.25e-01 0s 9 1.40917321e+02 8.44421861e+01 2.09e-03 2.05e-16 4.82e-02 0s 10 1.29236070e+02 1.14911997e+02 5.53e-05 2.29e-16 1.22e-02 0s 11 1.25061588e+02 1.24563254e+02 2.58e-12 2.35e-16 4.26e-04 0s 12 1.25000062e+02 1.24999563e+02 7.69e-13 2.22e-16 4.27e-07 0s 13 1.25000000e+02 1.25000000e+02 2.38e-13 2.37e-16 4.27e-13 0s Barrier solved model in 13 iterations and 0.01 seconds Optimal objective 1.25000000e+02 Root relaxation: objective 1.250000e+02, 320 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 17 659.00000 125.00000 81.0% - 0s H 0 0 129.0000000 125.00000 3.10% - 0s H 0 0 126.0000000 125.00000 0.79% - 0s 0 0 125.00000 0 14 126.00000 125.00000 0.79% - 0s 0 0 125.00000 0 19 126.00000 125.00000 0.79% - 0s H 0 0 125.0000000 125.00000 0.0% - 0s Explored 0 nodes (1154 simplex iterations) in 0.08 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.08 seconds Total run time: 0.10 seconds Objective: 125 Solution: 7 x [1, 3, 3, 5, 6, 6, 6, 8] 1 x [1, 2, 3, 4, 5, 7, 7, 9] 42 x [1, 1, 2, 3, 5, 6, 7, 9] 6 x [3, 5, 5, 5, 5, 5, 6, 9] 1 x [3, 5, 5, 5, 5, 5, 9, 9] 8 x [1, 1, 3, 3, 4, 6, 6, 7] 35 x [1, 1, 3, 3, 4, 6, 7, 7] 9 x [5, 5, 5, 5, 5, 6, 7, 9] 16 x [1, 1, 1, 2, 4, 7, 7, 9]