Build (method = -2) #dp: 2046 Step-3' Graph: 156 vertices and 822 arcs (0.01s) Step-4' Graph: 104 vertices and 718 arcs (0.01s) #V4/#V3 = 0.67 #A4/#A3 = 0.87 Ready! (0.01s) Optimize a model with 121 rows, 719 columns and 1957 nonzeros Presolve removed 9 rows and 18 columns Presolve time: 0.01s Presolved: 112 rows, 701 columns, 1931 nonzeros Variable types: 0 continuous, 701 integer (0 binary) Found heuristic solution: objective 176.0000000 Found heuristic solution: objective 170.0000000 Optimize a model with 112 rows, 701 columns and 1931 nonzeros Presolved: 112 rows, 701 columns, 1931 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.041e+03 Factor NZ : 2.698e+03 Factor Ops : 7.512e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.77310745e+03 -1.33138963e+04 1.11e+04 2.22e-16 6.24e+01 0s 1 5.78172914e+02 -5.24141957e+03 2.15e+03 5.55e-16 1.28e+01 0s 2 2.31562045e+02 -1.90302605e+03 3.09e+02 8.88e-16 2.50e+00 0s 3 1.61706785e+02 -4.33332090e+02 2.10e+01 1.33e-15 4.59e-01 0s 4 1.08954251e+02 -1.37899716e+02 5.99e+00 4.44e-16 1.82e-01 0s 5 6.98341348e+01 -6.57828129e+01 3.44e+00 3.33e-16 9.96e-02 0s 6 5.54262494e+01 -5.44913728e+01 2.32e+00 3.33e-16 8.00e-02 0s 7 4.58437213e+01 -2.20325831e+01 1.58e+00 2.00e-16 4.93e-02 0s 8 4.00517401e+01 2.05910328e+01 6.18e-01 2.22e-16 1.40e-02 0s 9 3.60224295e+01 3.05438691e+01 4.15e-02 2.35e-16 3.87e-03 0s 10 3.54212137e+01 3.53545539e+01 4.33e-14 2.53e-16 4.70e-05 0s 11 3.54000213e+01 3.53999546e+01 7.38e-14 3.33e-16 4.70e-08 0s 12 3.54000000e+01 3.54000000e+01 2.09e-13 2.38e-16 4.70e-11 0s Barrier solved model in 12 iterations and 0.01 seconds Optimal objective 3.54000000e+01 Root relaxation: objective 3.540000e+01, 449 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 35.40000 0 25 170.00000 35.40000 79.2% - 0s H 0 0 42.0000000 35.40000 15.7% - 0s H 0 0 36.0000000 35.40000 1.67% - 0s Explored 0 nodes (610 simplex iterations) in 0.04 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 3.600000000000e+01, best bound 3.600000000000e+01, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.04 seconds Total run time: 0.06 seconds Objective: 36 Solution: 2 x [4, 12, 12, 13, 15] 4 x [3, 7, 8, 15, 17] 4 x [3, 13, 13, 15, 15] 7 x [1, 6, 6, 11, 16] 1 x [6, 16, 16, 17] 2 x [6, 15, 16, 16, 17] 3 x [7, 10, 14, 15, 15] 4 x [1, 2, 5, 9, 13] 1 x [9, 13, 14, 15] 2 x [5, 9, 9, 9, 15] 1 x [5, 5, 6, 6, 15] 4 x [6, 6, 6, 6, 15] 1 x [10, 15, 15, 15]