Build (method = -2) #dp: 5178 Step-3' Graph: 483 vertices and 1710 arcs (0.03s) Step-4' Graph: 166 vertices and 1076 arcs (0.04s) #V4/#V3 = 0.34 #A4/#A3 = 0.63 Ready! (0.04s) Optimize a model with 226 rows, 1077 columns and 2903 nonzeros Presolve removed 49 rows and 51 columns Presolve time: 0.01s Presolved: 177 rows, 1026 columns, 2881 nonzeros Variable types: 0 continuous, 1026 integer (808 binary) Found heuristic solution: objective 31.0000000 Optimize a model with 177 rows, 1026 columns and 2881 nonzeros Presolved: 177 rows, 1026 columns, 2881 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.443e+03 Factor NZ : 4.524e+03 Factor Ops : 1.492e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.61942750e+03 -4.08294450e+03 6.50e+03 2.90e-01 2.21e+01 0s 1 7.27969389e+02 -1.31634754e+03 1.10e+03 1.78e-15 3.87e+00 0s 2 1.33272405e+02 -3.38932582e+02 1.11e+02 6.66e-16 4.88e-01 0s 3 4.55425409e+01 -5.85747851e+01 1.50e+01 5.55e-16 8.04e-02 0s 4 2.67622258e+01 -2.72855381e+00 1.29e+00 1.35e-15 1.63e-02 0s 5 2.40669474e+01 1.23564723e+01 4.96e-01 9.30e-16 6.02e-03 0s 6 2.18831140e+01 1.62438418e+01 1.81e-01 7.77e-16 2.83e-03 0s 7 2.06643005e+01 1.88832871e+01 4.38e-02 8.88e-16 8.82e-04 0s 8 2.02200638e+01 1.95957385e+01 5.59e-03 7.06e-16 3.06e-04 0s 9 2.01468174e+01 1.98479379e+01 3.39e-03 8.88e-16 1.47e-04 0s 10 2.00601905e+01 1.99471087e+01 1.02e-03 4.37e-16 5.54e-05 0s 11 2.00303319e+01 1.99836136e+01 2.56e-04 5.51e-16 2.28e-05 0s 12 2.00188173e+01 2.00061400e+01 5.29e-05 3.86e-16 6.19e-06 0s 13 2.00167516e+01 2.00109157e+01 3.06e-05 1.11e-15 2.85e-06 0s 14 2.00147246e+01 2.00131279e+01 8.51e-06 4.41e-16 7.80e-07 0s 15 2.00139939e+01 2.00137725e+01 9.81e-07 8.88e-16 1.08e-07 0s 16 2.00138909e+01 2.00138876e+01 5.51e-09 6.66e-16 1.62e-09 0s 17 2.00138889e+01 2.00138889e+01 8.92e-13 6.15e-16 1.08e-14 0s Barrier solved model in 17 iterations and 0.01 seconds Optimal objective 2.00138889e+01 Root relaxation: objective 2.001389e+01, 135 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 20.01389 0 80 31.00000 20.01389 35.4% - 0s H 0 0 22.0000000 20.01389 9.03% - 0s H 0 0 21.0000000 20.01389 4.70% - 0s Explored 0 nodes (257 simplex iterations) in 0.05 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.100000000000e+01, best bound 2.100000000000e+01, gap 0.0% Preprocessing time: 0.05 seconds Gurobi run time: 0.05 seconds Total run time: 0.10 seconds Objective: 21 Solution: 1 x [22, 32, 35] 1 x [26, 42, 46] 1 x [12, 20, 31] 1 x [7, 44, 47] 1 x [2, 3, 58] 1 x [14, 19, 48] 1 x [6, 36, 43] 1 x [9, 37] 1 x [18, 45, 59] 1 x [28, 29, 30] 1 x [11, 13, 53] 1 x [5, 39, 40] 1 x [21, 34, 41] 1 x [55, 56, 57] 1 x [10, 24, 33] 1 x [49, 50, 51] 1 x [4, 25] 1 x [1, 23, 60] 1 x [15, 16, 17] 1 x [38, 52, 54] 1 x [8, 27]