Build (method = -2) #dp: 1673 Step-3' Graph: 107 vertices and 718 arcs (0.01s) Step-4' Graph: 47 vertices and 598 arcs (0.01s) #V4/#V3 = 0.44 #A4/#A3 = 0.83 Ready! (0.01s) Optimize a model with 93 rows, 599 columns and 1708 nonzeros Presolve removed 7 rows and 12 columns Presolve time: 0.01s Presolved: 86 rows, 587 columns, 1608 nonzeros Variable types: 0 continuous, 587 integer (389 binary) Found heuristic solution: objective 36.0000000 Optimize a model with 86 rows, 587 columns and 1608 nonzeros Presolved: 86 rows, 587 columns, 1608 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 7.920e+02 Factor NZ : 1.914e+03 Factor Ops : 5.232e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.25898407e+03 -2.13539359e+03 4.24e+03 2.53e-01 1.52e+01 0s 1 3.01857431e+02 -6.90117221e+02 6.77e+02 6.66e-16 2.63e+00 0s 2 6.48704290e+01 -1.73199288e+02 5.50e+01 6.66e-16 3.24e-01 0s 3 3.41220287e+01 -1.38458307e+01 6.82e+00 2.78e-16 5.17e-02 0s 4 2.53679573e+01 5.23896237e+00 1.30e+00 4.37e-16 1.83e-02 0s 5 2.20757940e+01 1.66749438e+01 2.97e-01 3.19e-16 4.71e-03 0s 6 2.07113558e+01 1.86155482e+01 7.98e-02 2.22e-16 1.80e-03 0s 7 2.03926100e+01 1.94368519e+01 4.06e-02 3.59e-16 8.21e-04 0s 8 2.01205483e+01 1.98853674e+01 8.33e-03 3.98e-16 2.01e-04 0s 9 2.00429989e+01 1.99437937e+01 2.70e-03 3.08e-16 8.46e-05 0s 10 2.00095299e+01 1.99805959e+01 3.70e-04 2.69e-16 2.45e-05 0s 11 2.00014673e+01 1.99960224e+01 3.51e-05 2.64e-16 4.60e-06 0s 12 2.00000836e+01 1.99999184e+01 1.55e-06 2.49e-16 1.40e-07 0s 13 2.00000001e+01 1.99999999e+01 6.21e-13 3.19e-16 1.40e-10 0s Barrier solved model in 13 iterations and 0.01 seconds Optimal objective 2.00000001e+01 Root relaxation: objective 2.000000e+01, 27 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 20.0000000 20.00000 0.0% - 0s Explored 0 nodes (27 simplex iterations) in 0.03 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.000000000000e+01, best bound 2.000000000000e+01, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.03 seconds Total run time: 0.05 seconds Objective: 20 Solution: 1 x [40, 41, 43] 1 x [39, 42, 43] 1 x [37, 44, 46] 1 x [3, 31, 46] 1 x [1, 3, 35] 1 x [6, 34, 44] 1 x [2, 4, 33] 1 x [5, 13, 29] 1 x [9, 14, 28] 1 x [11, 15, 27] 1 x [13, 15, 23] 1 x [24, 25, 41] 1 x [21, 26, 44] 1 x [7, 19, 21] 1 x [12, 17, 20] 1 x [11, 18, 25] 1 x [10, 16, 22] 1 x [4, 32, 38] 1 x [8, 30, 38] 1 x [4, 36, 45]