Build (method = -2) #dp: 2828 Step-3' Graph: 393 vertices and 1172 arcs (0.02s) Step-4' Graph: 259 vertices and 904 arcs (0.02s) #V4/#V3 = 0.66 #A4/#A3 = 0.77 Ready! (0.02s) Optimize a model with 279 rows, 905 columns and 2201 nonzeros Presolve removed 34 rows and 60 columns Presolve time: 0.01s Presolved: 245 rows, 845 columns, 2156 nonzeros Variable types: 0 continuous, 845 integer (43 binary) Optimize a model with 245 rows, 845 columns and 2156 nonzeros Presolved: 245 rows, 845 columns, 2156 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.533e+03 Factor NZ : 6.952e+03 Factor Ops : 2.773e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.21426770e+03 -3.44785831e+04 4.78e+04 6.98e-02 1.40e+02 0s 1 5.96748238e+02 -1.82218495e+04 5.77e+03 2.79e-02 2.33e+01 0s 2 3.30606938e+02 -5.14714841e+03 1.45e+03 2.44e-15 5.77e+00 0s 3 2.15172153e+02 -8.92488284e+02 1.65e+02 6.66e-16 8.82e-01 0s 4 1.66357813e+02 -3.77743140e+02 2.14e+01 6.66e-16 3.42e-01 0s 5 1.35687433e+02 -2.75831469e+02 1.12e+01 6.66e-16 2.53e-01 0s 6 1.22043824e+02 -1.49288285e+02 7.70e+00 2.78e-16 1.66e-01 0s 7 1.05414946e+02 -1.15224630e+02 5.56e+00 3.75e-16 1.34e-01 0s 8 9.10550321e+01 -2.11097102e+00 2.94e+00 3.40e-16 5.64e-02 0s 9 8.27061182e+01 5.29909223e+01 4.31e-01 2.09e-16 1.77e-02 0s 10 7.80827291e+01 6.95841907e+01 1.32e-01 2.22e-16 5.06e-03 0s 11 7.66083556e+01 7.43125049e+01 3.47e-02 1.76e-16 1.36e-03 0s 12 7.61080569e+01 7.57283824e+01 3.03e-03 3.33e-16 2.25e-04 0s 13 7.60508745e+01 7.60472646e+01 1.34e-05 2.92e-16 2.14e-06 0s 14 7.60500009e+01 7.60499973e+01 9.24e-14 2.22e-16 2.14e-09 0s 15 7.60500000e+01 7.60500000e+01 1.03e-13 2.22e-16 2.14e-12 0s Barrier solved model in 15 iterations and 0.02 seconds Optimal objective 7.60500000e+01 Root relaxation: objective 7.605000e+01, 295 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 76.05000 0 69 - 76.05000 - - 0s H 0 0 82.0000000 76.05000 7.26% - 0s H 0 0 78.0000000 76.05000 2.50% - 0s 0 0 76.05000 0 84 78.00000 76.05000 2.50% - 0s H 0 0 77.0000000 76.05000 1.23% - 0s Cutting planes: Gomory: 1 Zero half: 1 Explored 0 nodes (1137 simplex iterations) in 0.15 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 7.700000000000e+01, best bound 7.700000000000e+01, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.15 seconds Total run time: 0.18 seconds Objective: 77 Solution: 2 x [4, 6, 10, 18] 13 x [1, 4, 5, 6, 18, 19] 1 x [2, 6, 10, 11, 12] 2 x [2, 6, 7, 15] 1 x [2, 6, 11, 15] 5 x [6, 11, 12, 14, 15] 1 x [5, 6, 7, 12, 13, 16] 3 x [6, 10, 12, 13, 15] 1 x [6, 11, 12, 15] 5 x [3, 6, 7, 10, 11, 13, 17] 1 x [2, 12, 15, 20] 8 x [7, 9, 12, 14, 16] 6 x [3, 8, 9, 10, 12, 16] 6 x [7, 8, 9, 11, 13, 15] 2 x [1, 5, 7, 9, 10, 15, 19] 1 x [7, 11, 12, 15, 19] 2 x [3, 5, 8, 12, 13, 16, 17, 18] 1 x [3, 5, 10, 12, 13, 18] 10 x [1, 3, 8, 13, 14, 16, 17, 18] 6 x [3, 5, 8, 13, 14, 16, 17, 18]