Build (method = -2) #dp: 5332 Step-3' Graph: 243 vertices and 1744 arcs (0.02s) Step-4' Graph: 166 vertices and 1590 arcs (0.02s) #V4/#V3 = 0.68 #A4/#A3 = 0.91 Ready! (0.02s) Optimize a model with 216 rows, 1591 columns and 4445 nonzeros Presolve removed 43 rows and 46 columns Presolve time: 0.04s Presolved: 173 rows, 1545 columns, 4447 nonzeros Variable types: 0 continuous, 1545 integer (1330 binary) Found heuristic solution: objective 35.0000000 Optimize a model with 173 rows, 1545 columns and 4447 nonzeros Presolved: 173 rows, 1545 columns, 4447 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.458e+03 Factor NZ : 5.672e+03 Factor Ops : 2.535e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.77913820e+02 -2.08282915e+03 3.01e+03 2.37e-01 5.45e+00 0s 1 2.49409275e+02 -5.94018054e+02 5.90e+02 8.88e-16 1.13e+00 0s 2 7.29974793e+01 -1.61140714e+02 8.37e+01 1.11e-15 1.86e-01 0s 3 2.72727432e+01 -1.82137679e+01 4.49e+00 6.66e-16 1.99e-02 0s 4 2.37871651e+01 6.15900440e+00 1.83e+00 4.49e-16 6.89e-03 0s 5 2.16198288e+01 1.11367099e+01 7.76e-01 4.44e-16 3.75e-03 0s 6 1.91610172e+01 1.42469914e+01 2.17e-01 4.81e-16 1.67e-03 0s 7 1.79412102e+01 1.56312529e+01 5.56e-02 4.44e-16 7.64e-04 0s 8 1.74554452e+01 1.63265251e+01 1.15e-02 4.44e-16 3.68e-04 0s 9 1.72642527e+01 1.65339762e+01 4.42e-03 4.44e-16 2.37e-04 0s 10 1.70303678e+01 1.69109920e+01 8.78e-06 4.44e-16 3.87e-05 0s 11 1.70003650e+01 1.69999064e+01 7.27e-14 4.44e-16 1.48e-07 0s 12 1.70000004e+01 1.69999999e+01 4.15e-14 4.44e-16 1.48e-10 0s 13 1.70000000e+01 1.70000000e+01 3.18e-14 4.44e-16 2.42e-16 0s Barrier solved model in 13 iterations and 0.02 seconds Optimal objective 1.70000000e+01 Root relaxation: objective 1.700000e+01, 139 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 17.0000000 17.00000 0.0% - 0s Explored 0 nodes (139 simplex iterations) in 0.07 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.700000000000e+01, best bound 1.700000000000e+01, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.07 seconds Total run time: 0.10 seconds Objective: 17 Solution: 1 x [5, 29, 43] 1 x [4, 34, 48] 1 x [2, 39, 46] 1 x [10, 14, 47] 1 x [1, 42, 50] 1 x [9, 26, 38] 1 x [18, 19, 41] 1 x [13, 28, 30] 1 x [15, 22, 37] 1 x [3, 32, 49] 1 x [17, 24, 33] 1 x [12, 20, 45] 1 x [8, 27, 40] 1 x [16, 21, 36] 1 x [6, 31, 35] 1 x [7, 25, 44] 1 x [11, 23, 39]