Build (method = -2) #dp: 1910 Step-3' Graph: 71 vertices and 386 arcs (0.01s) Step-4' Graph: 37 vertices and 318 arcs (0.01s) #V4/#V3 = 0.52 #A4/#A3 = 0.82 Ready! (0.01s) Optimize a model with 74 rows, 319 columns and 888 nonzeros Presolve removed 16 rows and 18 columns Presolve time: 0.01s Presolved: 58 rows, 301 columns, 859 nonzeros Variable types: 0 continuous, 301 integer (211 binary) Found heuristic solution: objective 25.0000000 Found heuristic solution: objective 24.0000000 Optimize a model with 58 rows, 301 columns and 859 nonzeros Presolved: 58 rows, 301 columns, 859 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.050e+02 Factor NZ : 1.151e+03 Factor Ops : 2.839e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.81868338e+02 -1.11250345e+03 1.03e+03 2.51e-01 1.57e+01 0s 1 1.06028091e+02 -3.43095652e+02 1.88e+02 4.44e-16 2.99e+00 0s 2 3.95777331e+01 -8.58115220e+01 1.41e+01 5.55e-16 3.54e-01 0s 3 2.38648938e+01 -3.66702945e+00 5.11e-01 4.44e-16 4.85e-02 0s 4 2.02054450e+01 1.14295849e+01 1.19e-01 2.22e-16 1.47e-02 0s 5 1.82890157e+01 1.57610366e+01 2.17e-02 2.39e-16 4.19e-03 0s 6 1.79146835e+01 1.70253748e+01 8.53e-03 2.22e-16 1.47e-03 0s 7 1.77393613e+01 1.72738615e+01 3.69e-03 2.22e-16 7.69e-04 0s 8 1.76231937e+01 1.74375612e+01 9.56e-04 1.11e-16 3.06e-04 0s 9 1.75626742e+01 1.74949717e+01 1.29e-04 2.22e-16 1.11e-04 0s 10 1.75496115e+01 1.75280582e+01 4.84e-05 2.22e-16 3.54e-05 0s 11 1.75435621e+01 1.75414135e+01 7.76e-06 2.22e-16 3.54e-06 0s 12 1.75425218e+01 1.75422554e+01 3.85e-07 3.33e-16 4.38e-07 0s 13 1.75423767e+01 1.75423692e+01 7.19e-09 2.22e-16 1.23e-08 0s 14 1.75423729e+01 1.75423729e+01 2.27e-11 3.33e-16 3.17e-13 0s Barrier solved model in 14 iterations and 0.01 seconds Optimal objective 1.75423729e+01 Root relaxation: objective 1.754237e+01, 55 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 17.54237 0 31 24.00000 17.54237 26.9% - 0s H 0 0 19.0000000 17.54237 7.67% - 0s H 0 0 18.0000000 17.54237 2.54% - 0s Explored 0 nodes (80 simplex iterations) in 0.02 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.800000000000e+01, best bound 1.800000000000e+01, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.02 seconds Total run time: 0.04 seconds Objective: 18 Solution: 1 x [6, 11, 37] 1 x [1, 1, 37] 1 x [8, 10, 36] 1 x [8, 10, 35] 1 x [19, 34] 1 x [3, 14, 34] 1 x [20, 33] 1 x [17, 32] 1 x [25, 31] 1 x [6, 15, 30] 1 x [4, 23, 29] 1 x [7, 19, 29] 1 x [8, 13, 29] 1 x [5, 21, 28] 1 x [2, 22, 27] 1 x [9, 18, 26] 1 x [6, 24, 24] 1 x [12, 16, 18]