Build (method = -2) #dp: 7470 Step-3' Graph: 99 vertices and 1214 arcs (0.04s) Step-4' Graph: 99 vertices and 1214 arcs (0.04s) #V4/#V3 = 1.00 #A4/#A3 = 1.00 Ready! (0.04s) Optimize a model with 119 rows, 1215 columns and 3473 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.01s Presolved: 117 rows, 1213 columns, 3469 nonzeros Variable types: 0 continuous, 1213 integer (46 binary) Found heuristic solution: objective 366.0000000 Found heuristic solution: objective 316.0000000 Optimize a model with 117 rows, 1213 columns and 3469 nonzeros Presolved: 117 rows, 1213 columns, 3469 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.048e+03 Factor NZ : 4.103e+03 Factor Ops : 1.748e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 9.66620155e+03 -5.65778958e+04 4.58e+04 5.73e-02 3.99e+02 0s 1 2.49481314e+03 -3.59337666e+04 7.29e+03 8.88e-16 7.08e+01 0s 2 7.74969622e+02 -1.68999018e+04 1.02e+03 1.64e-14 1.37e+01 0s 3 6.26801174e+02 -4.14505018e+03 1.44e+02 4.44e-15 2.44e+00 0s 4 3.71719571e+02 -8.47233377e+02 8.60e+00 4.44e-15 5.11e-01 0s 5 3.55441080e+02 -5.07392672e+02 4.46e-01 2.89e-15 3.53e-01 0s 6 3.37068164e+02 -4.28797404e+02 3.74e-01 2.44e-15 3.14e-01 0s 7 2.85432805e+02 -2.60715157e+02 2.21e-01 1.67e-15 2.24e-01 0s 8 1.58092065e+02 -3.09037365e+01 5.69e-02 6.66e-16 7.73e-02 0s 9 9.97850739e+01 1.38188295e+01 2.75e-02 3.33e-16 3.52e-02 0s 10 7.62555052e+01 2.39189982e+01 1.47e-02 2.64e-16 2.14e-02 0s 11 7.26439217e+01 3.74878406e+01 9.41e-03 3.33e-16 1.44e-02 0s 12 6.17519754e+01 4.37322866e+01 5.06e-03 2.33e-16 7.37e-03 0s 13 5.95110170e+01 4.82435193e+01 3.68e-03 3.33e-16 4.61e-03 0s 14 5.77780605e+01 5.10565791e+01 2.26e-03 2.60e-16 2.75e-03 0s 15 5.64575373e+01 5.26381650e+01 1.17e-03 2.75e-16 1.56e-03 0s 16 5.59740315e+01 5.42509223e+01 7.48e-04 2.44e-16 7.05e-04 0s 17 5.52049696e+01 5.51658473e+01 1.52e-12 2.70e-16 1.60e-05 0s 18 5.52000050e+01 5.51999655e+01 2.87e-13 3.35e-16 1.61e-08 0s 19 5.52000000e+01 5.52000000e+01 2.73e-13 3.42e-16 1.61e-11 0s Barrier solved model in 19 iterations and 0.02 seconds Optimal objective 5.52000000e+01 Root relaxation: objective 5.520000e+01, 931 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 55.20000 0 29 316.00000 55.20000 82.5% - 0s H 0 0 56.0000000 55.20000 1.43% - 0s Explored 0 nodes (2053 simplex iterations) in 0.12 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 5.600000000000e+01, best bound 5.600000000000e+01, gap 0.0% Preprocessing time: 0.05 seconds Gurobi run time: 0.12 seconds Total run time: 0.17 seconds Objective: 56 Solution: 13 x [1, 4, 6, 13] 6 x [4, 5, 6, 13, 16] 4 x [2, 4, 8, 10, 11, 11, 17] 4 x [2, 2, 4, 8, 11, 11, 19, 20] 4 x [2, 3, 3, 4, 9, 10, 13, 16, 17, 17, 19, 19] 1 x [2, 2, 4, 11, 13, 13, 14, 15, 17, 19, 19] 1 x [3, 4, 9, 9, 13] 10 x [6, 7, 7, 12, 16] 4 x [6, 9, 9, 12, 13, 14, 16, 17, 19] 1 x [2, 6, 8, 17, 17, 18, 20] 1 x [2, 8, 9, 9, 9, 10, 13, 14, 17, 17, 17, 19, 20] 5 x [2, 2, 8, 11, 11, 14, 15, 16, 19, 20] 2 x [2, 3, 3, 8, 9, 9, 9, 11, 11, 13, 13, 17, 17, 17, 20]