Build (method = -2) #dp: 796 Step-3' Graph: 106 vertices and 491 arcs (0.00s) Step-4' Graph: 87 vertices and 453 arcs (0.00s) #V4/#V3 = 0.82 #A4/#A3 = 0.92 Ready! (0.00s) Optimize a model with 106 rows, 454 columns and 1198 nonzeros Presolve removed 20 rows and 37 columns Presolve time: 0.01s Presolved: 86 rows, 417 columns, 1135 nonzeros Variable types: 0 continuous, 417 integer (0 binary) Found heuristic solution: objective 174.0000000 Found heuristic solution: objective 172.0000000 Found heuristic solution: objective 144.0000000 Optimize a model with 86 rows, 417 columns and 1135 nonzeros Presolved: 86 rows, 417 columns, 1135 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 6.550e+02 Factor NZ : 1.869e+03 Factor Ops : 4.794e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.26195634e+03 -1.05028756e+04 8.17e+03 2.22e-16 9.36e+01 0s 1 4.56193419e+02 -4.62342141e+03 1.31e+03 8.88e-16 1.70e+01 0s 2 2.20855291e+02 -1.38248838e+03 1.29e+02 1.33e-15 2.68e+00 0s 3 1.76985732e+02 -4.12120575e+02 6.91e+00 1.44e-15 7.21e-01 0s 4 1.25971291e+02 -1.86726184e+02 1.39e+00 4.44e-16 3.73e-01 0s 5 1.00911589e+02 -6.65634212e+01 6.23e-01 3.33e-16 1.99e-01 0s 6 8.51517686e+01 1.05398857e+01 2.32e-01 3.33e-16 8.85e-02 0s 7 8.26673212e+01 5.17776630e+01 1.93e-01 2.22e-16 3.67e-02 0s 8 7.65782274e+01 6.29908419e+01 1.01e-01 2.22e-16 1.61e-02 0s 9 7.34870115e+01 6.55131028e+01 4.72e-02 2.22e-16 9.47e-03 0s 10 7.20380601e+01 6.84672685e+01 2.40e-02 2.22e-16 4.24e-03 0s 11 7.07905605e+01 6.98597975e+01 3.76e-03 2.22e-16 1.10e-03 0s 12 7.05039588e+01 7.02681379e+01 6.12e-04 2.22e-16 2.79e-04 0s 13 7.04514833e+01 7.03966092e+01 1.27e-04 2.22e-16 6.50e-05 0s 14 7.04378860e+01 7.04360814e+01 2.41e-06 2.22e-16 2.14e-06 0s 15 7.04375000e+01 7.04374999e+01 4.14e-11 2.22e-16 1.26e-10 0s Barrier solved model in 15 iterations and 0.01 seconds Optimal objective 7.04375000e+01 Root relaxation: objective 7.043750e+01, 143 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 70.43750 0 12 144.00000 70.43750 51.1% - 0s H 0 0 71.0000000 70.43750 0.79% - 0s Explored 0 nodes (288 simplex iterations) in 0.03 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 7.100000000000e+01, best bound 7.100000000000e+01, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.03 seconds Total run time: 0.04 seconds Objective: 71 Solution: 1 x [7, 7, 8] 4 x [5, 15] 1 x [3, 15] 6 x [3, 13] 11 x [2, 18] 1 x [2, 15] 4 x [7, 7, 17, 19] 1 x [4, 4, 17, 19] 4 x [9, 11] 3 x [10, 11] 7 x [1, 11, 14] 9 x [1, 7, 13] 3 x [6, 12, 16, 17] 1 x [6, 7, 12, 12] 5 x [6, 6, 12] 1 x [7, 12, 13] 7 x [12, 12, 12, 16] 1 x [12, 16, 16] 1 x [12, 16, 16, 16]