Build (method = -2) #dp: 1242 Step-3' Graph: 89 vertices and 612 arcs (0.00s) Step-4' Graph: 45 vertices and 524 arcs (0.00s) #V4/#V3 = 0.51 #A4/#A3 = 0.86 Ready! (0.00s) Optimize a model with 86 rows, 525 columns and 1490 nonzeros Presolve removed 8 rows and 15 columns Presolve time: 0.01s Presolved: 78 rows, 510 columns, 1389 nonzeros Variable types: 0 continuous, 510 integer (355 binary) Found heuristic solution: objective 35.0000000 Optimize a model with 78 rows, 510 columns and 1389 nonzeros Presolved: 78 rows, 510 columns, 1389 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 7.760e+02 Factor NZ : 1.618e+03 Factor Ops : 4.271e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.00293710e+01 -1.64400851e+03 3.76e+03 2.34e-01 1.94e+01 0s 1 8.70533444e+01 -5.34818017e+02 7.87e+02 5.55e-16 4.08e+00 0s 2 3.81978426e+01 -1.68974954e+02 4.87e+01 1.33e-15 3.97e-01 0s 3 2.56848429e+01 -9.90264137e+00 3.28e+00 4.44e-16 4.37e-02 0s 4 2.07597410e+01 5.64070813e+00 7.71e-01 6.66e-16 1.60e-02 0s 5 1.87524850e+01 1.44207124e+01 1.45e-01 4.44e-16 4.32e-03 0s 6 1.81021592e+01 1.61818102e+01 4.95e-02 8.88e-16 1.90e-03 0s 7 1.77006102e+01 1.68140171e+01 1.37e-02 6.66e-16 8.70e-04 0s 8 1.75038869e+01 1.72515194e+01 2.82e-03 4.44e-16 2.47e-04 0s 9 1.74483527e+01 1.73649317e+01 9.69e-04 4.44e-16 8.16e-05 0s 10 1.74165828e+01 1.73972234e+01 5.73e-05 8.88e-16 1.88e-05 0s 11 1.74129568e+01 1.74101906e+01 1.16e-05 4.44e-16 2.69e-06 0s 12 1.74120440e+01 1.74120300e+01 7.32e-14 4.44e-16 1.35e-08 0s 13 1.74120370e+01 1.74120370e+01 7.94e-13 6.66e-16 1.35e-11 0s Barrier solved model in 13 iterations and 0.01 seconds Optimal objective 1.74120370e+01 Root relaxation: objective 1.741204e+01, 60 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 17.41204 0 43 35.00000 17.41204 50.3% - 0s H 0 0 18.0000000 17.41204 3.27% - 0s Explored 0 nodes (85 simplex iterations) in 0.03 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.03 seconds Total run time: 0.05 seconds Objective: 18 Solution: 1 x [5, 7] 1 x [6, 6] 1 x [4, 16] 1 x [3, 13, 20] 1 x [2, 10, 22] 1 x [1, 11] 1 x [16, 21, 41] 1 x [9, 27, 40] 1 x [18, 18, 39] 1 x [8, 30, 38] 1 x [12, 24, 37] 1 x [14, 25, 36] 1 x [15, 26, 35] 1 x [8, 33, 34] 1 x [12, 30, 33] 1 x [19, 26, 32] 1 x [17, 29, 31] 1 x [23, 24, 28]